Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
sav08:lecture07 [2008/03/11 17:27] vkuncak |
sav08:lecture07 [2008/03/12 12:54] vkuncak |
||
---|---|---|---|
Line 1: | Line 1: | ||
- | ====== Propositional Proofs and Simple SAT Solvers ====== | + | ====== Propositional Proofs ====== |
This is continuation of [[lecture06]]. | This is continuation of [[lecture06]]. | ||
+ | |||
+ | Goals: | ||
+ | * discuss proof systems for propositional logic that are useful for SAT solvers | ||
+ | * further illustrate notions of soundness and completeness of proof systems | ||
+ | * show properties of proof systems on infinite formulas, because they will be useful in first-order logic | ||
+ | * discuss some SAT solving techniques | ||
[[Satisfiability of Sets of Formulas]] | [[Satisfiability of Sets of Formulas]] | ||
Line 12: | Line 18: | ||
[[Interpolants from Resolution Proofs]] | [[Interpolants from Resolution Proofs]] | ||
+ | |||
+ | [[Polynomial Algorithm for Horn Clauses]] | ||
[[DPLL Algorithm for SAT]] | [[DPLL Algorithm for SAT]] |