1. Satisfiability in the Year 2005

   • Enrico Giunchiglia
   • Toby Walsh

   OriginalPaper 31 August 2006 Pages: 1 - 2

2. Heuristic-Based Backtracking Relaxation for Propositional Satisfiability

   • Ateet Bhalla
   • Inês Lynce
   • João Marques-Silva

   OriginalPaper 23 December 2005 Pages: 3 - 24

3. Symbolic Techniques in Satisfiability Solving

   • Guoqiang Pan
   • Moshe Y. Vardi

   OriginalPaper 17 December 2005 Pages: 25 - 50

4. Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas

   • Michael Alekhnovich
   • Edward A. Hirsch
   • Dmitry Itsykson

   OriginalPaper 15 August 2006 Pages: 51 - 72

5. Backdoor Sets for DLL Subsolvers

   • Stefan Szeider

   OriginalPaper 19 January 2006 Pages: 73 - 88

6. The Complexity of Pure Literal Elimination

   • Jan Johannsen

   OriginalPaper 17 December 2005 Pages: 89 - 95

7. Clause Weighting Local Search for SAT

   • John Thornton

   OriginalPaper 11 August 2006 Pages: 97 - 142

8. Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings

   • Alan M. Frisch
   • Timothy J. Peugniez
   • Peter W. Nightingale

   OriginalPaper 19 January 2006 Pages: 143 - 179

9. Regular Random k-SAT: Properties of Balanced Formulas

   • Yacine Boufkhad
   • Olivier Dubois
   • Bart Selman

   OriginalPaper 03 August 2006 Pages: 181 - 200

10. Applying SAT Solving in Classification of Finite Algebras

    • Andreas Meier
    • Volker Sorge

    OriginalPaper 19 January 2006 Pages: 201 - 235

11. The SAT-based Approach to Separation Logic

    • Alessandro Armando
    • Claudio Castellini
    • Marco Maratea

    OriginalPaper 28 December 2005 Pages: 237 - 263

12. MathSAT: Tight Integration of SAT and Mathematical Decision Procedures

    • Marco Bozzano
    • Roberto Bruttomesso
    • Roberto Sebastiani

    OriginalPaper 09 December 2005 Pages: 265 - 293