| 0 | -- | 0 | Daniel Le Berre, Laurent Simon. Preface |
| 1 | -- | 26 | Niklas Eén, Niklas Sörensson. Translating Pseudo-Boolean Constraints into SAT |
| 27 | -- | 46 | Harri Haanpää, Matti Järvisalo, Petteri Kaski, Ilkka Niemelä. Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques |
| 47 | -- | 59 | Marijn Heule, Hans van Maaren. March_dl: Adding Adaptive Heuristics and a New Branching Strategy |
| 61 | -- | 102 | Oliver Kullmann. The SAT 2005 Solver Competition on Random Instances |
| 103 | -- | 143 | Vasco M. Manquinho, Olivier Roussel. The First Evaluation of Pseudo-Boolean Solvers (PB 05) |
| 145 | -- | 164 | Massimo Narizzano, Luca Pulina, Armando Tacchella. Report of the Third QBF Solvers Evaluation |
| 165 | -- | 189 | Hossein M. Sheini, Karem A. Sakallah. Pueblo: A Hybrid Pseudo-Boolean SAT Solver |
| 191 | -- | 200 | Olivier Bailleux, Yacine Boufkhad, Olivier Roussel. A Translation of Pseudo Boolean Constraints to SAT |
| 201 | -- | 208 | Armin Biere, Carsten Sinz. Decomposing SAT Problems into Connected Components |
| 209 | -- | 219 | Vasco M. Manquinho, João P. Marques Silva. On Using Cutting Planes in Pseudo-Boolean Optimization |
| 221 | -- | 227 | Klas Markström. Locality and Hard SAT-Instances |
| 229 | -- | 237 | Emmanuel Zarpas. Back to the SAT05 Competition: an a Posteriori Analysis of Solver Performance on Industrial Benchmarks |