| 2018 | Effective Use of SMT Solvers for Program Equivalence Checking Through Invariant-Sketching and Query-Decomposition. | Shubhani Gupta, Aseem Saxena, Anmol Mahajan, Sorav Bansal |
| 2018 | Cops-Robber Games and the Resolution of Tseitin Formulas. | Nicola Galesi, Navid Talebanfard, Jacobo Torn |
| 2018 | Exploiting Treewidth for Projected Model Counting and Its Limits. | Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran |
| 2018 | Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers. | Jan Elffers, Jess Girldez-Cru, Jakob Nordstrm, Marc Vinyals |
| 2018 | Approximately Propagation Complete and Conflict Propagating Constraint Encodings. | Rdiger Ehlers, Francisco Palau Romero |
| 2018 | Tuning Parallel SAT Solvers. | Thorsten Ehlers, Dirk Nowotka |
| 2018 | Experimenting on Solving Nonlinear Integer Arithmetic with Incremental Linearization. | Alessandro Cimatti, Alberto Griggio, Ahmed Irfan, Marco Roveri, Roberto Sebastiani |
| 2018 | The Effect of Scrambling CNFs. | Armin Biere, Marijn Heule |
| 2018 | Evaluating CDCL Restart Schemes. | Armin Biere, Andreas Frhlich |
| 2018 | Finding All Minimal Safe Inductive Sets. | Ryan Berryhill, Alexander Ivrii, Andreas G. Veneris |
| 2018 | Applications of MaxSAT in Data Analysis. | Jeremias Berg, Antti Hyttinen, Matti Jrvisalo |
| 2018 | Fast and Flexible Probabilistic Model Counting. | Dimitris Achlioptas, Zayd Hammoudeh, Panos Theodoropoulos |
| 2018 | Fast Sampling of Perfectly Uniform Satisfying Assignments. | Dimitris Achlioptas, Zayd S. Hammoudeh, Panos Theodoropoulos |
| 2018 | Minimal Unsatisfiability and Minimal Strongly Connected Digraphs. | Hoda Abbasizanjani, Oliver Kullmann |
| 2018 | Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT. | Tobias Friedrich, Ralf Rothenberger |
| 2018 | Local Soundness for QBF Calculi. | Martin Suda, Bernhard Gleiss |
| 2017 | From DQBF to QBF by Dependency Elimination. | Ralf Wimmer, Andreas Karrenbauer, Ruben Becker, Christoph Scholl, Bernd Becker |
| 2017 | Introducing Pareto Minimal Correction Subsets. | Miguel Terra-Neves, Ins Lynce, Vasco Manquinho |
| 2017 | A Resolution-Style Proof System for DQBF. | Markus N. Rabe |
| 2017 | Improving MCS Enumeration via Caching. | Alessandro Previti, Carlos Menca, Matti Jrvisalo, Joo Marques-Silva |
| 2017 | Dependency Learning for QBF. | Toms Peitl, Friedrich Slivovsky, Stefan Szeider |
| 2017 | A Propagation Rate Based Splitting Heuristic for Divide-and-Conquer Solvers. | Saeed Nejati, Zack Newsham, Joseph Scott, Jia Hui Liang, Catherine H. Gebotys, Pascal Poupart, Vijay Ganesh |
| 2017 | Coverage-Based Clause Reduction Heuristics for CDCL Solvers. | Hidetomo Nabeshima, Katsumi Inoue |
| 2017 | SAT-Encodings for Special Treewidth and Pathwidth. | Neha Lodha, Sebastian Ordyniak, Stefan Szeider |
| 2017 | An Empirical Study of Branching Heuristics Through the Lens of Global Learning Rate. | Jia Hui Liang, Hari Govind V. K., Pascal Poupart, Krzysztof Czarnecki, Vijay Ganesh |