Handbook of Satisfiability 2009

Part I. Theory and Algorithms

• John Franco, John Martin:
  A History of Satisfiability. 3-74
  
• Steven David Prestwich:
  CNF Encodings. 75-97
  
• Adnan Darwiche, Knot Pipatsrisawat:
  Complete Algorithms. 99-130
  
• João P. Marques Silva, Inês Lynce, Sharad Malik:
  Conflict-Driven Clause Learning SAT Solvers. 131-153
  
• Marijn Heule, Hans van Maaren:
  Look-Ahead Based SAT Solvers. 155-184
  
• Henry A. Kautz, Ashish Sabharwal, Bart Selman:
  Incomplete Algorithms. 185-203
  
• Oliver Kullmann:
  Fundaments of Branching Heuristics. 205-244
  
• Dimitris Achlioptas:
  Random Satisfiability. 245-270
  
• Carla P. Gomes, Ashish Sabharwal:
  Exploiting Runtime Variation in Complete Solvers. 271-288
  
• Karem A. Sakallah:
  Symmetry and Satisfiability. 289-338
  
• Hans Kleine Büning, Oliver Kullmann:
  Minimal Unsatisfiability and Autarkies. 339-401
  
• Evgeny Dantsin, Edward A. Hirsch:
  Worst-Case Upper Bounds. 403-424
  
• Marko Samer, Stefan Szeider:
  Fixed-Parameter Tractability. 425-454
  

Part II. Applications and Extensions

• Armin Biere:
  Bounded Model Checking. 457-481
  
• Jussi Rintanen:
  Planning and SAT. 483-504
  
• Daniel Kroening:
  Software Verification. 505-532
  
• Hantao Zhang:
  Combinatorial Designs by SAT Solvers. 533-568
  
• Fabrizio Altarelli, Rémi Monasson, Guilhem Semerjian, Francesco Zamponi:
  Connections to Statistical Physics. 569-611
  
• Chu Min Li, Felip Manyà:
  MaxSAT, Hard and Soft Constraints. 613-631
  
• Carla P. Gomes, Ashish Sabharwal, Bart Selman:
  Model Counting. 633-654
  
• Rolf Drechsler, Tommi A. Junttila, Ilkka Niemelä:
  Non-Clausal SAT and ATPG. 655-693
  
• Olivier Roussel, Vasco M. Manquinho:
  Pseudo-Boolean and Cardinality Constraints. 695-733
  
• Hans Kleine Büning, Uwe Bubeck:
  Theory of Quantified Boolean Formulas. 735-760
  
• Enrico Giunchiglia, Paolo Marin, Massimo Narizzano:
  Reasoning with Quantified Boolean Formulas. 761-780
  
• Roberto Sebastiani, Armando Tacchella:
  SAT Techniques for Modal and Description Logics. 781-824
  
• Clark W. Barrett, Roberto Sebastiani, Sanjit A. Seshia, Cesare Tinelli:
  Satisfiability Modulo Theories. 825-885
  
• Stephen M. Majercik:
  Stochastic Boolean Satisfiability. 887-925
  

Last update Wed Feb 15 04:52:43 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page