| 2006 | Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ALC. | Roberto Sebastiani, Michele Vescovi |
| 2006 | Binary Clause Reasoning in QBF. | Horst Samulowitz, Fahiem Bacchus |
| 2006 | QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency. | Ashish Sabharwal, Carlos Anstegui, Carla P. Gomes, Justin W. Hart, Bart Selman |
| 2006 | Local Search for Unsatisfiability. | Steven D. Prestwich, Ins Lynce |
| 2006 | On Linear CNF Formulas. | Stefan Porschen, Ewald Speckenmeyer, Bert Randerath |
| 2006 | Solving #SAT Using Vertex Covers. | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
| 2006 | On SAT Modulo Theories and Optimization Problems. | Robert Nieuwenhuis, Albert Oliveras |
| 2006 | Counting Models in Integer Domains. | Antnio Morgado, Paulo J. Matos, Vasco Manquinho, Joo Marques-Silva |
| 2006 | Applications of SAT Solvers to Cryptanalysis of Hash Functions. | Ilya Mironov, Lintao Zhang |
| 2006 | Implementing Survey Propagation on Graphics Processing Units. | Panagiotis Manolios, Yimin Zhang |
| 2006 | SAT in Bioinformatics: Making the Case with Haplotype Inference. | Ins Lynce, Joo Marques-Silva |
| 2006 | Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel. | Oliver Kullmann, Ins Lynce, Joo Marques-Silva |
| 2006 | Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. | Arist Kojevnikov, Alexander S. Kulikov |
| 2006 | Extended Resolution Proofs for Symbolic SAT Solving with Quantification. | Toni Jussila, Carsten Sinz, Armin Biere |
| 2006 | Satisfiability Checking of Non-clausal Formulas Using General Matings. | Himanshu Jain, Constantinos Bartzis, Edmund M. Clarke |
| 2006 | A Distribution Method for Solving SAT in Grids. | Antti Eero Johannes Hyvrinen, Tommi A. Junttila, Ilkka Niemel |
| 2006 | Characterizing Propagation Methods for Boolean Satisfiability. | Eric I. Hsu, Sheila A. McIlraith |
| 2006 | Determinization of Resolution by an Algorithm Operating on Complete Assignments. | Eugene Goldberg |
| 2006 | Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs. | Allen Van Gelder |
| 2006 | On Solving the Partial MAX-SAT Problem. | Zhaohui Fu, Sharad Malik |
| 2006 | A Scalable Algorithm for Minimal Unsatisfiable Core Extraction. | Nachum Dershowitz, Ziyad Hanna, Alexander Nadel |
| 2006 | MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s | Evgeny Dantsin, Alexander Wolpert |
| 2006 | Fast and Flexible Difference Constraint Propagation for DPLL(T). | Scott Cotton, Oded Maler |
| 2006 | A Dichotomy Theorem for Typed Constraint Satisfaction Problems. | Su Chen, Tomasz Imielinski, Karin Johnsgard, Donald Smith, Mario Szegedy |
| 2006 | Encoding CNFs to Empower Component Analysis. | Mark Chavira, Adnan Darwiche |