| 2005 | On Finding All Minimally Unsatisfiable Subformulas. | Mark H. Liffiton, Karem A. Sakallah |
| 2005 | Speedup Techniques Utilized in Modern SAT Solvers. | Matthew D. T. Lewis, Tobias Schubert, Bernd Becker |
| 2005 | Automated Generation of Simplification Rules for SAT and MAXSAT. | Alexander S. Kulikov |
| 2005 | Resolution Tunnels for Improved SAT Solver Performance. | Michal Kouril, John V. Franco |
| 2005 | Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution. | Edward A. Hirsch, Sergey I. Nikolenko |
| 2005 | Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming. | Marijn Heule, Hans van Maaren |
| 2005 | Equivalence Checking of Circuits with Parameterized Specifications. | Eugene Goldberg |
| 2005 | Cost-Effective Hyper-Resolution for Preprocessing CNF Formulas. | Roman Gershman, Ofer Strichman |
| 2005 | Local and Global Complete Solution Learning Methods for QBF. | Ian P. Gent, Andrew G. D. Rowley |
| 2005 | Input Distance and Lower Bounds for Propositional Resolution Proof Length. | Allen Van Gelder |
| 2005 | Resolution and Pebbling Games. | Nicola Galesi, Neil Thapen |
| 2005 | Effective Preprocessing in SAT Through Variable and Clause Elimination. | Niklas En, Armin Biere |
| 2005 | Variable Ordering for Efficient SAT Search by Analyzing Constraint-Variable Dependencies. | Vijay Durairaj, Priyank Kalla |
| 2005 | A Clause-Based Heuristic for SAT Solvers. | Nachum Dershowitz, Ziyad Hanna, Alexander Nadel |
| 2005 | Bounded Model Checking with QBF. | Nachum Dershowitz, Ziyad Hanna, Jacob Katz |
| 2005 | An Improved Upper Bound for SAT. | Evgeny Dantsin, Alexander Wolpert |
| 2005 | A Branching Heuristics for Quantified Renamable Horn Formulas. | Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe |
| 2005 | Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas. | Uwe Bubeck, Hans Kleine Bning, Xishun Zhao |
| 2005 | Quantifier Trees for QBFs. | Marco Benedetti |
| 2005 | Substitutional Definition of Satisfiability in Classical Propositional Logic. | Anton Belov, Zbigniew Stachniak |
| 2005 | A Symbolic Search Based Approach for Quantified Boolean Formulas. | Gilles Audemard, Lakhdar Sais |
| 2005 | Solving Over-Constrained Problems with SAT Technology. | Josep Argelich, Felip Many |
| 2005 | Improved Exact Solvers for Weighted Max-SAT. | Teresa Alsinet, Felip Many, Jordi Planes |
| 2004 | Game-SAT: A Preliminary Report. | Ling Zhao, Martin Mller |
| 2004 | A SAT Based Scheduler for Tournament Schedules. | Hantao Zhang, Dapeng Li, Haiou Shen |