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 02:03] vkuncak |
sav08:lecture07 [2008/03/12 12:55] vkuncak |
||
|---|---|---|---|
| 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 basic SAT solving algorithms | + | * discuss some SAT solving techniques |
| [[Satisfiability of Sets of Formulas]] | [[Satisfiability of Sets of Formulas]] | ||
| Line 19: | Line 19: | ||
| [[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]]. | ||