| 2011 | A Compact and Efficient SAT-Encoding of Finite Domain CSP. Tomoya Tanjo, Naoyuki Tamura, Mutsunori Banbara |
| 2011 | A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs. Ewald Speckenmeyer, Andreas Wotzlaw, Stefan Porschen |
| 2011 | Abstraction-Based Algorithm for 2QBF. Mikolás Janota, João Marques-Silva |
| 2011 | Analyzing the Instances of the MaxSAT Evaluation. Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes |
| 2011 | Applying UCT to Boolean Satisfiability. Alessandro Previti, Raghuram Ramanujan, Marco Schaerf, Bart Selman |
| 2011 | BDDs for Pseudo-Boolean Constraints - Revisited. Ignasi Abío, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell |
| 2011 | Between Restarts and Backjumps. Antonio Ramos, Peter van der Tak, Marijn Heule |
| 2011 | Captain Jack: New Variable Selection Heuristics in Local Search for SAT. Dave A. D. Tompkins, Adrian Balint, Holger H. Hoos |
| 2011 | Careful Ranking of Multiple Solvers with Timeouts and Ties. Allen Van Gelder |
| 2011 | Concolic Testing and Constraint Satisfaction. Koushik Sen |
| 2011 | Connecting SAT Algorithms and Complexity Lower Bounds. Ryan Williams |
| 2011 | DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions. Alexey Ignatiev, Alexander A. Semenov |
| 2011 | EagleUP: Solving Random 3-SAT Using SLS with Unit Propagation. Oliver Gableske, Marijn Heule |
| 2011 | Efficient CNF Simplification Based on Binary Implication Graphs. Marijn Heule, Matti Järvisalo, Armin Biere |
| 2011 | Empirical Study of the Anatomy of Modern Sat Solvers. Hadi Katebi, Karem A. Sakallah, João P. Marques Silva |
| 2011 | Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight. Nadia Creignou, Frédéric Olive, Johannes Schmidt |
| 2011 | Failed Literal Detection for QBF. Florian Lonsing, Armin Biere |
| 2011 | Faster Extraction of High-Level Minimal Unsatisfiable Cores. Vadim Ryvchin, Ofer Strichman |
| 2011 | Generalized Conflict-Clause Strengthening for Satisfiability Solvers. Allen Van Gelder |
| 2011 | Generating Diverse Solutions in SAT. Alexander Nadel |
| 2011 | How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms. Martin Mundhenk, Robert Zeranski |
| 2011 | Learning Polarity from Structure in SAT. Bryan Silverthorn, Risto Miikkulainen |
| 2011 | Minimally Unsatisfiable Boolean Circuits. Anton Belov, João Marques-Silva |
| 2011 | Model Counting Using the Inclusion-Exclusion Principle. Huxley Bennett, Sriram Sankaranarayanan |
| 2011 | Non-Model-Based Algorithm Portfolios for SAT. Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann |
| 2011 | On Freezing and Reactivating Learnt Clauses. Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais |
| 2011 | On Improving MUS Extraction Algorithms. João Marques-Silva, Inês Lynce |
| 2011 | On Variables with Few Occurrences in Conjunctive Normal Forms. Oliver Kullmann, Xishun Zhao |
| 2011 | Parameterized Complexity of DPLL Search Procedures. Olaf Beyersdorff, Nicola Galesi, Massimo Lauria |
| 2011 | Phase Transitions in Knowledge Compilation: An Experimental Study. Jian Gao, Minghao Yin, Ke Xu |
| 2011 | Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One. Ignasi Abío, Morgan Deters, Robert Nieuwenhuis, Peter J. Stuckey |
| 2011 | Satisfiability Certificates Verifiable in Subexponential Time. Evgeny Dantsin, Edward A. Hirsch |
| 2011 | Satisfiability of Acyclic and almost Acyclic CNF Formulas (II). Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider |
| 2011 | The Order Encoding: From Tractable CSP to Tractable SAT. Justyna Petke, Peter Jeavons |
| 2011 | Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings Karem A. Sakallah, Laurent Simon |
| 2011 | Transformations into Normal Forms for Quantified Circuits. Hans Kleine Büning, Xishun Zhao, Uwe Bubeck |
| 2011 | Translating Pseudo-Boolean Constraints into CNF. Amir Aavani |