| 2013 | A Constraint Satisfaction Approach for Programmable Logic Detailed Placement. Andrew Mihal, Steve Teig |
| 2013 | A Modular Approach to MaxSAT Modulo Theories. Alessandro Cimatti, Alberto Griggio, Bastiaan Joost Schaafsma, Roberto Sebastiani |
| 2013 | A Rank Lower Bound for Cutting Planes Proofs of Ramsey's Theorem. Massimo Lauria |
| 2013 | A SAT Approach to Clique-Width. Marijn Heule, Stefan Szeider |
| 2013 | Cliquewidth and Knowledge Compilation. Igor Razgon, Justyna Petke |
| 2013 | Community-Based Partitioning for MaxSAT Solving. Ruben Martins, Vasco Manquinho, Inês Lynce |
| 2013 | Concurrent Clause Strengthening. Siert Wieringa, Keijo Heljanko |
| 2013 | Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation. Florian Lonsing, Uwe Egly, Allen Van Gelder |
| 2013 | Experiments with Reduction Finding. Charles Jordan, Lukasz Kaiser |
| 2013 | Exploiting the Power of mip Solvers in maxsat. Jessica Davies, Fahiem Bacchus |
| 2013 | Exponential Separations in a Hierarchy of Clause Learning Proof Systems. Jan Johannsen |
| 2013 | Factoring Out Assumptions to Speed Up MUS Extraction. Jean-Marie Lagniez, Armin Biere |
| 2013 | Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction. Gilles Audemard, Jean-Marie Lagniez, Laurent Simon |
| 2013 | LearnSAT: A SAT Solver for Education. Mordechai Ben-Ari |
| 2013 | Local Backbones. Ronald de Haan, Iyad A. Kanj, Stefan Szeider |
| 2013 | MUStICCa: MUS Extraction with Interactive Choice of Candidates. Johannes Dellert, Christian Zielke, Michael Kaufmann |
| 2013 | Minimizing Models for Tseitin-Encoded SAT Instances. Ashlin Iser, Carsten Sinz, Mana Taghdiri |
| 2013 | Nested Boolean Functions as Models for Quantified Boolean Formulas. Uwe Bubeck, Hans Kleine Büning |
| 2013 | On Propositional QBF Expansions and Q-Resolution. Mikolás Janota, João Marques-Silva |
| 2013 | On the Interpolation between Product-Based Message Passing Heuristics for SAT. Oliver Gableske |
| 2013 | On the Resolution Complexity of Graph Non-isomorphism. Jacobo Torán |
| 2013 | Parallel MUS Extraction. Anton Belov, Norbert Manthey, João Marques-Silva |
| 2013 | Quantified Maximum Satisfiability: - A Core-Guided Approach. Alexey Ignatiev, Mikolás Janota, João Marques-Silva |
| 2013 | Recovering and Utilizing Partial Duality in QBF. Alexandra Goultiaeva, Fahiem Bacchus |
| 2013 | SCSat: A Soft Constraint Guided SAT Solver. Hiroshi Fujita, Miyuki Koshimura, Ryuzo Hasegawa |
| 2013 | Scarab: A Rapid Prototyping Tool for SAT-Based Constraint Programming Systems. Takehide Soh, Naoyuki Tamura, Mutsunori Banbara |
| 2013 | Snappy: A Simple Algorithm Portfolio. Horst Samulowitz, Chandra Reddy, Ashish Sabharwal, Meinolf Sellmann |
| 2013 | Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability. Marcelo Finger, Ronan LeBras, Carla P. Gomes, Bart Selman |
| 2013 | Soundness of Inprocessing in Clause Sharing SAT Solvers. Norbert Manthey, Tobias Philipp, Christoph Wernhard |
| 2013 | The Complexity of Theorem Proving in Autoepistemic Logic. Olaf Beyersdorff |
| 2013 | The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi-algebraic Proofs. Albert Atserias |
| 2013 | Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings Matti Järvisalo, Allen Van Gelder |
| 2013 | There Are No CNF Problems. Peter J. Stuckey |
| 2013 | Turing's Computable Real Numbers and Why They Are Still Important Today. Edmund M. Clarke |
| 2013 | Upper and Lower Bounds for Weak Backdoor Set Detection. Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider |