| 1 | -- | 2 | Enrico Giunchiglia, Toby Walsh. Satisfiability in the Year 2005 |
| 3 | -- | 24 | Ateet Bhalla, Inês Lynce, José T. de Sousa, João Marques-Silva. Heuristic-Based Backtracking Relaxation for Propositional Satisfiability |
| 25 | -- | 50 | Guoqiang Pan, Moshe Y. Vardi. Symbolic Techniques in Satisfiability Solving |
| 51 | -- | 72 | Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson. Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas |
| 73 | -- | 88 | Stefan Szeider. Backdoor Sets for DLL Subsolvers |
| 89 | -- | 95 | Jan Johannsen. The Complexity of Pure Literal Elimination |
| 97 | -- | 142 | John Thornton. Clause Weighting Local Search for SAT |
| 143 | -- | 179 | Alan M. Frisch, Timothy J. Peugniez, Anthony J. Doggett, Peter Nightingale. Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings |
| 181 | -- | 200 | Yacine Boufkhad, Olivier Dubois, Yannet Interian, Bart Selman. Regular Random ::::k::::-SAT: Properties of Balanced Formulas |
| 201 | -- | 235 | Andreas Meier, Volker Sorge. Applying SAT Solving in Classification of Finite Algebras |
| 237 | -- | 263 | Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea. The SAT-based Approach to Separation Logic |
| 265 | -- | 293 | Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Peter van Rossum, Stephan Schulz, Roberto Sebastiani. MathSAT: Tight Integration of SAT and Mathematical Decision Procedures |