Validity (formula is tautology, true for all assignments) and satisfiability (there exists assignment for which formula is true).

Decidability of propositional logic

Conjunctive normal form: conjunction of clauses. Each clause is a disjunction of literals. Literal is propositional formula or its negation.

Tseitin's encoding

DPLL Algorithm for SAT

Advanced SAT solving Techniques

DPvis

• Lower Bounds for Resolution and Cutting Plane Proofs and Monotone Computations
• Course at MPI, Lecture 4

• Decision Procedure Toolkit
• The Quest for Efficient Boolean Satisfiability Solvers
• http://www.satcompetition.org/
• http://minisat.se/
• http://satlive.org/
• zChaff
• http://reasoning.cs.ucla.edu/rsat/
• PicoSAT

• http://www.decision-procedures.org/

• http://alloy.mit.edu
• http://web.mit.edu/~emina/www/kodkod.html
• http://www.cs.chalmers.se/~koen/folkung/

• lecture06
• lecture07
• lecture08