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/12 01:26] vkuncak |
sav08:lecture07 [2008/03/12 13:29] vkuncak |
||
---|---|---|---|
Line 1: | Line 1: | ||
- | ====== Propositional Proofs and Simple SAT Solvers ====== | + | ====== Propositional Proofs ====== |
This is continuation of [[lecture06]]. | This is continuation of [[lecture06]]. | ||
Line 7: | Line 7: | ||
* further illustrate notions of soundness and completeness of proof systems | * 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 | * show properties of proof systems on infinite formulas, because they will be useful in first-order logic | ||
- | * discuss SAT basic solving algorithms | + | * discuss some SAT solving techniques |
+ | |||
+ | ===== Topics ===== | ||
[[Satisfiability of Sets of Formulas]] | [[Satisfiability of Sets of Formulas]] | ||
Line 19: | Line 21: | ||
[[Interpolants from Resolution Proofs]] | [[Interpolants from Resolution Proofs]] | ||
- | [[Polynomial Algorithm for Horn Clauses]] | + | [[Polynomial Algorithm for Horn Clauses]] and Boolean Constraint Propagation |
- | + | ||
- | [[DPLL Algorithm for SAT]] | + | |
Continued in [[lecture08]]. | Continued in [[lecture08]]. |