| 2007 | From Idempotent Generalized Boolean Assignments to Multi-bit Search. | Marijn Heule, Hans van Maaren |
| 2007 | Formalizing Dangerous SAT Encodings. | Alexander Hertel, Philipp Hertel, Alasdair Urquhart |
| 2007 | MiniMaxSat: A New Weighted Max-SAT Solver. | Federico Heras, Javier Larrosa, Albert Oliveras |
| 2007 | Short XORs for Model Counting: From Theory to Practice. | Carla P. Gomes, Jrg Hoffmann, Ashish Sabharwal, Bart Selman |
| 2007 | Verifying Propositional Unsatisfiability: Pitfalls to Avoid. | Allen Van Gelder |
| 2007 | SAT Solving for Termination Analysis with Polynomial Interpretations. | Carsten Fuhs, Jrgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, Ren Thiemann, Harald Zankl |
| 2007 | Applying Logic Synthesis for Speeding Up SAT. | Niklas En, Alan Mishchenko, Niklas Srensson |
| 2007 | Towards a Better Understanding of the Functionality of a Conflict-Driven SAT Solver. | Nachum Dershowitz, Ziyad Hanna, Alexander Nadel |
| 2007 | Inversion Attacks on Secure Hash Functions Using satSolvers. | Debapratim De, Abishek Kumarasubramanian, Ramarathnam Venkatesan |
| 2007 | SAT: Past and Future. | Martin Davis |
| 2007 | A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories. | Alessandro Cimatti, Alberto Griggio, Roberto Sebastiani |
| 2007 | Minimum 2CNF Resolution Refutations in Polynomial Time. | Joshua Buresh-Oppenheim, David G. Mitchell |
| 2007 | Bounded Universal Expansion for Preprocessing QBF. | Uwe Bubeck, Hans Kleine Bning |
| 2007 | Circuit Based Encoding of CNF Formula. | Gilles Audemard, Lakhdar Sais |
| 2007 | Partial Max-SAT Solvers with Clause Learning. | Josep Argelich, Felip Many |
| 2007 | Mapping CSP into Many-Valued SAT. | Carlos Anstegui, Maria Luisa Bonet, Jordi Levy, Felip Many |
| 2007 | Sensor Deployment for Failure Diagnosis in Networked Aerial Robots: A Satisfiability-Based Approach. | Fadi A. Aloul, Nagarajan Kandasamy |
| 2006 | A Complete Random Jump Strategy with Guiding Paths. | Hantao Zhang |
| 2006 | Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies. | Yuliya Zabiyaka, Adnan Darwiche |
| 2006 | Lemma Learning in SMT on Linear Constraints. | Yinlei Yu, Sharad Malik |
| 2006 | Average-Case Analysis for the MAX-2SAT Problem. | Osamu Watanabe, Masaki Yamamoto |
| 2006 | sharpSAT - Counting Models with Advanced Component Caching and Implicit BCP. | Marc Thurley |
| 2006 | Solving Quantified Boolean Formulas with Circuit Observability Don't Cares. | Daijue Tang, Sharad Malik |
| 2006 | A Progressive Simplifier for Satisfiability Modulo Theories. | Hossein M. Sheini, Karem A. Sakallah |
| 2006 | From Propositional Satisfiability to Satisfiability Modulo Theories. | Hossein M. Sheini, Karem A. Sakallah |