DPLL Algorithm for SAT
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.
- Course at MPI, Lecture 4