| 2013 | Factoring Out Assumptions to Speed Up MUS Extraction. | Jean-Marie Lagniez, Armin Biere |
| 2013 | Experiments with Reduction Finding. | Charles Jordan, Lukasz Kaiser |
| 2013 | Exponential Separations in a Hierarchy of Clause Learning Proof Systems. | Jan Johannsen |
| 2013 | On Propositional QBF Expansions and Q-Resolution. | Mikols Janota, Joo Marques-Silva |
| 2013 | Minimizing Models for Tseitin-Encoded SAT Instances. | Ashlin Iser, Carsten Sinz, Mana Taghdiri |
| 2013 | Quantified Maximum Satisfiability: - A Core-Guided Approach. | Alexey Ignatiev, Mikols Janota, Joo Marques-Silva |
| 2013 | A SAT Approach to Clique-Width. | Marijn Heule, Stefan Szeider |
| 2013 | Local Backbones. | Ronald de Haan, Iyad A. Kanj, Stefan Szeider |
| 2013 | Recovering and Utilizing Partial Duality in QBF. | Alexandra Goultiaeva, Fahiem Bacchus |
| 2013 | On the Interpolation between Product-Based Message Passing Heuristics for SAT. | Oliver Gableske |
| 2013 | SCSat: A Soft Constraint Guided SAT Solver. | Hiroshi Fujita, Miyuki Koshimura, Ryuzo Hasegawa |
| 2013 | Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability. | Marcelo Finger, Ronan LeBras, Carla P. Gomes, Bart Selman |
| 2013 | MUStICCa: MUS Extraction with Interactive Choice of Candidates. | Johannes Dellert, Christian Zielke, Michael Kaufmann |
| 2013 | Exploiting the Power of mip Solvers in maxsat. | Jessica Davies, Fahiem Bacchus |
| 2013 | Turing's Computable Real Numbers and Why They Are Still Important Today. | Edmund M. Clarke |
| 2013 | A Modular Approach to MaxSAT Modulo Theories. | Alessandro Cimatti, Alberto Griggio, Bastiaan Joost Schaafsma, Roberto Sebastiani |
| 2013 | Nested Boolean Functions as Models for Quantified Boolean Formulas. | Uwe Bubeck, Hans Kleine Bning |
| 2013 | The Complexity of Theorem Proving in Autoepistemic Logic. | Olaf Beyersdorff |
| 2013 | LearnSAT: A SAT Solver for Education. | Mordechai Ben-Ari |
| 2013 | Parallel MUS Extraction. | Anton Belov, Norbert Manthey, Joo Marques-Silva |
| 2013 | Boosting the Performance of SLS and CDCL Solvers by Preprocessor Tuning. | Adrian Balint, Norbert Manthey |
| 2013 | Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction. | Gilles Audemard, Jean-Marie Lagniez, Laurent Simon |
| 2013 | The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi-algebraic Proofs. | Albert Atserias |
| 2013 | Analysis of Portfolio-Style Parallel SAT Solving on Current Multi-Core Architectures. | Martin Aigner, Armin Biere, Christoph M. Kirsch, Aina Niemetz, Mathias Preiner |
| 2012 | Faulty Interaction Identification via Constraint Solving and Optimization. | Jian Zhang, Feifei Ma, Zhiqiang Zhang |