Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Last revision Both sides next revision | ||
sav08:lecture07 [2008/03/11 17:27] vkuncak |
sav08:lecture07 [2008/03/12 21:53] 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 | ||
+ | |||
+ | ===== Topics ===== | ||
[[Satisfiability of Sets of Formulas]] | [[Satisfiability of Sets of Formulas]] | ||
Line 13: | Line 21: | ||
[[Interpolants from Resolution Proofs]] | [[Interpolants from Resolution Proofs]] | ||
- | [[DPLL Algorithm for SAT]] | + | [[Polynomial Algorithm for Horn Clauses]] and Boolean Constraint Propagation |
Continued in [[lecture08]]. | Continued in [[lecture08]]. | ||
Line 22: | Line 30: | ||
* [[Logic for Mathematics and Computer Science Textbook]] | * [[Logic for Mathematics and Computer Science Textbook]] | ||
* [[:Gallier Logic Book]] | * [[:Gallier Logic Book]] | ||
+ | * An Introduction to [[Mathematical Logic and Type Theory]] | ||
* [[http://www.mpi-inf.mpg.de/~uwe/lehre/autreas/readings.html|Course at MPI]], Lecture 4 | * [[http://www.mpi-inf.mpg.de/~uwe/lehre/autreas/readings.html|Course at MPI]], Lecture 4 | ||
* {{:ganzingerbachmairconstructionslides.pdf|Ganzinger-Bachmair Model Construction}} | * {{:ganzingerbachmairconstructionslides.pdf|Ganzinger-Bachmair Model Construction}} | ||