This is continuation of lecture06.

Satisfiability of Sets of Formulas

Compactness Theorem

Definition of Propositional Resolution

Deriving Propositional Resolution

Interpolants from Resolution Proofs

DPLL Algorithm for SAT

Continued in lecture08.

• Calculus of Computation Textbook, Chapter 1
• Logic for Mathematics and Computer Science Textbook
• Gallier Logic Book
• Course at MPI, Lecture 4

• http://www.sat4j.org/
• http://www.satcompetition.org/
• http://minisat.se/
• http://satlive.org/
• OpenSAT
• Decision Procedure Toolkit

• http://www.princeton.edu/~chaff/zchaff.html
• http://reasoning.cs.ucla.edu/rsat/
• Ganzinger-Bachmair Model Construction
• Lower Bounds for Resolution and Cutting Plane Proofs and Monotone Computations
• The Complexity of Boolean Functions