1. On SAT instance classes and a method for reliable performance experiments with SAT solvers

   • Franc Brglez
   • Xiao Yu Li
   • Matthias F. Stallmann

   OriginalPaper 31 December 2004 Pages: 1 - 34

2. On exact selection of minimally unsatisfiable subformulae

   • Renato Bruni

   OriginalPaper 31 December 2004 Pages: 35 - 50

3. The complexity of Boolean constraint satisfaction local search problems

   • Philippe Chapdelaine
   • Nadia Creignou

   OriginalPaper 31 December 2004 Pages: 51 - 63

4. Testing satisfiability of CNF formulas by computing a stable set of points

   • Eugene Goldberg

   OriginalPaper 31 December 2004 Pages: 65 - 89

5. UnitWalk: A new SAT solver that uses local search guided by unit clause elimination

   • Edward A. Hirsch
   • Arist Kojevnikov

   OriginalPaper 31 December 2004 Pages: 91 - 111

6. The complexity of homomorphisms and renamings for minimal unsatisfiable formulas

   • Hans Kleine Büning
   • Daoyun Xu

   OriginalPaper 31 December 2004 Pages: 113 - 127

7. Solving the resolution-free SAT problem by submodel propagation in linear time

   • Gábor Kusper

   OriginalPaper 31 December 2004 Pages: 129 - 136

8. Efficient data structures for backtrack search SAT solvers

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

   OriginalPaper 31 December 2004 Pages: 137 - 152

9. Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: A large deviation analysis of the generalized unit clause heuristic for random 3-SAT

   • Simona Cocco
   • Rémi Monasson

   OriginalPaper 31 December 2004 Pages: 153 - 172

10. Exact 3-satisfiability is decidable in time O(2^0.16254n )

    • Stefan Porschen
    • Bert Randerath
    • Ewald Speckenmeyer

    OriginalPaper 31 December 2004 Pages: 173 - 193

11. A SAT approach to query optimization in mediator systems

    • Steven Prestwich
    • Stéphane Bressan

    OriginalPaper 31 December 2004 Pages: 195 - 210

12. Probability logic and optimization SAT: The PSAT and CPA models

    • Daniele Pretolani

    OriginalPaper 31 December 2004 Pages: 211 - 221

13. Generalizations of matched CNF formulas

    • Stefan Szeider

    OriginalPaper 31 December 2004 Pages: 223 - 238

14. Toward leaner binary-clause reasoning in a satisfiability solver

    • Allen Van Gelder

    OriginalPaper 31 December 2004 Pages: 239 - 253

15. On deciding subsumption problems

    • Uwe Egly
    • Reinhard Pichler
    • Stefan Woltran

    OriginalPaper 31 December 2004 Pages: 255 - 294

16. Extension and equivalence problems for clause minimal formulae

    • Hans Kleine Büning
    • Xishun Zhao

    OriginalPaper 31 December 2004 Pages: 295 - 306

17. The SAT2002 competition

    • Laurent Simon
    • Daniel Le Berre
    • Edward A. Hirsch

    OriginalPaper 31 December 2004 Pages: 307 - 342

18. A parsimony tree for the SAT2002 competition

    • Paul W. Purdom
    • Daniel Le Berre
    • Laurent Simon

    OriginalPaper 31 December 2004 Pages: 343 - 365

19. Annals of Mathematics and Artificial Intelligence

    Announcement 24 April 2014 Pages: 367 - 371