Accepted papers

List of accepted papers

  1. Dimitris Achlioptas and Panos Theodoropoulos. Probabilistic Model Counting with Short XORs
  2. Gilles Audemard, Jean Marie Lagniez, Nicolas Szczepanski and Sebastien Tabary. A Distributed Version of Syrup
  3. Guillaume Baud-Berthier, Jesus Giráldez-Cru and Laurent Simon. On the community structure of Bounded Model Checking SAT problems
  4. Joshua Blinkhorn and Olaf Beyersdorff. Shortening QBF Proofs with Dependency Schemes
  5. Eldan Cohen, Guoyu Huang and J. Christopher Beck. (I Can Get) Satisfaction: Preference-based Scheduling for Concert-Goers at Multi-Venue Music Festivals
  6. Jo Devriendt, Bart Bogaerts and Maurice Bruynooghe. Symmetric explanation learning: effective dynamic symmetry handling for SAT
  7. Johannes K. Fichte, Neha Lodha and Stefan Szeider. SAT-Based Local Improvement for Finding Tree Decompositions of Small Width
  8. Robert Ganian, M. S. Ramanujan and Stefan Szeider. Backdoor Treewidth for SAT
  9. Robert Ganian and Stefan Szeider. New Width Parameters for Model Counting
  10. Antti Hyvärinen, Sepideh Asadi, Karine Even-Mendoza, Grigory Fedyukovich, Hana Chockler and Natasha Sharygina. Theory Refinement for Program Verification
  11. Alexey Ignatiev, Antonio Morgado and Joao Marques-Silva. On Tackling the Limits of Resolution in SAT Solving
  12. Dmitry Itsykson and Alexander Knop. Hard satisfiable formulas for splittings by linear combinations
  13. Martin Jonas and Jan Strejček. On Simplification of Formulas with Unconstrained Variables and Quantifiers
  14. Tommi Junttila, Matti Karppa, Petteri Kaski and Jukka Kohonen. An adaptive prefix-assignment technique for symmetry reduction
  15. Bishoksan Kafle, Graeme Gange, Peter Schachte, Harald Sondergaard and Peter J. Stuckey. A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic
  16. Benjamin Kiesl, Marijn Heule and Martina Seidl. A Little Blocked Literal Goes a Long Way
  17. Tuukka Korhonen, Jeremias Berg, Paul Saikko and Matti Järvisalo. MaxPre: An Extended MaxSAT Preprocessor
  18. Petr Kucera, Petr Savicky and Vojtech Vorel. A lower bound on CNF encodings of the at-most-one constraint
  19. Peter Lammich. The GRAT Tool Chain: Efficient (UN)SAT Certificate Checking with Formal Correctness Guarantees
  20. Massimo Lauria, Jan Elffers, Jakob Nordstrom and Marc Vinyals. CNFgen: a Generator of Crafted Benchmarks
  21. Ludovic Le Frioux, Souheib Baarir, Julien Sopena and Fabrice Kordon. PainLess: a Framework for Parallel SAT Solving
  22. Jia Liang, Vijay Ganesh, Krzysztof Czarnecki, Pascal Poupart and Hari Govind V K. An Empirical Study of Branching Heuristics through the Lens of Global Learning Rate
  23. Neha Lodha, Sebastian Ordyniak and Stefan Szeider. SAT-Encodings for Special Treewidth and Pathwidth
  24. Hidetomo Nabeshima and Katsumi Inoue. Coverage-based Clause Reduction Heuristics for CDCL Solvers
  25. Saeed Nejati, Zack Newsham, Joseph Scott, Jia Liang, Catherine Gebotys, Pascal Poupart and Vijay Ganesh. A Propagation Rate based Splitting Heuristic for Divide-and-Conquer Solvers
  26. Tomáš Peitl, Friedrich Slivovsky and Stefan Szeider. Dependency Learning for QBF
  27. Alessandro Previti, Carlos Mencia, Matti Järvisalo and Joao Marques-Silva. Improving MCS Enumeration via Caching
  28. Markus N. Rabe. A Resolution-style Proof System for DQBF
  29. Miguel Terra-Neves, Inês Lynce and Vasco Manquinho. Introducing Pareto Minimal Correction Subsets
  30. Ralf Wimmer, Andreas Karrenbauer, Ruben Becker, Christoph Scholl and Bernd Becker. From DQBF to QBF by Dependency Elimination