Proseminar "Decision Procedures based on SAT (Propositional Satisfiability)" - Literature

DPLL - Procedure for SAT

Steffen Lösch:

• Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli
  Abstract DPLL and Abstract DPLL Modulo Theories, in "LNCS 3452", Springer
  

DPLL - Implementations for SAT

Daniel Wand:

• Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, Sharad Malik
  Chaff: Engineering an Efficient SAT Solver in Proceedings of Design Automation Conference, 2001.
• Niklas Sorensson, Niklas Een
  MiniSat v1.13 A SAT Solver with Conflict-Clause Minimization

Christoph Grün:

• Niklas Een, Armin Biere
  Effective Preprocessing in SAT through Variable and Clause Elimination in "LNCS 3569", Springer
• Evgueni Goldberg, Yakov Novikov
  BerkMin: a Fast and Robust SAT-Solver, Design Automation and Test in Europe, 2002

Planning

Maria Luschkova:

• Henry Kautz, Bart Selman
  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search in Proceedings of the 13th National Conference on Artificial Intelligence and the Eight Innovative Applications of Artificial Intelligence Conference, AAAI Press, 1996

• Decision Procedures based on SAT:
• Lecturers
• Start
• When and Where
• Prerequisites
• Example Topics
• Literature
• Registration
• Grading
• Miscellaneous