1. Satisfiability in the Year 2000

   • Ian P. Gent
   • Toby Walsh

   Editorial Introduction Pages: 1 - 3

2. A SAT Solver Using Reconfigurable Hardware and Virtual Logic

   • Miron Abramovici
   • Jose T. De Sousa

   OriginalPaper Pages: 5 - 36

3. Relaxations of the Satisfiability Problem Using Semidefinite Programming

   • Etienne de Klerk
   • Hans van Maaren
   • Joost P. Warners

   OriginalPaper Pages: 37 - 65

4. Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems

   • Carla P. Gomes
   • Bart Selman
   • Henry Kautz

   OriginalPaper Pages: 67 - 100

5. The Propositional Formula Checker HeerHugo

   • Jan Friso Groote
   • Joost P. Warners

   OriginalPaper Pages: 101 - 125

6. SAT Local Search Algorithms: Worst-Case Study

   • Edward A. Hirsch

   OriginalPaper Pages: 127 - 143

7. Proving Consistency Assertions for Automotive Product Data Management

   • Wolfgang Küchlin
   • Carsten Sinz

   OriginalPaper Pages: 145 - 163

8. Logical Cryptanalysis as a SAT Problem

   • Fabio Massacci
   • Laura Marraro

   OriginalPaper Pages: 165 - 203

9. Guided Local Search for Solving SAT and Weighted MAX-SAT Problems

   • Patrick Mills
   • Edward Tsang

   OriginalPaper Pages: 205 - 223

10. Resolution versus Search: Two Strategies for SAT

    • Irina Rish
    • Rina Dechter

    OriginalPaper Pages: 225 - 275

11. Implementing the Davis–Putnam Method

    • Hantao Zhang
    • Mark Stickel

    OriginalPaper Pages: 277 - 296