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:26] vkuncak |
sav08:lecture07 [2008/03/12 02:03] 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 SAT basic solving algorithms | ||
[[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]] | ||
Line 23: | Line 31: | ||
* [[:Gallier Logic Book]] | * [[:Gallier Logic Book]] | ||
* [[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 | ||
- | |||
- | * [[http://www.sat4j.org/]] | ||
- | * [[http://www.satcompetition.org/]] | ||
- | * [[http://minisat.se/]] | ||
- | * [[http://satlive.org/]] | ||
- | * [[http://sat.inesc-id.pt/OpenSAT/index.php|OpenSAT]] | ||
- | * [[http://sourceforge.net/projects/dpt|Decision Procedure Toolkit]] | ||
- | |||
- | * [[http://www.princeton.edu/~chaff/zchaff.html]] | ||
- | * [[http://reasoning.cs.ucla.edu/rsat/]] | ||
* {{:ganzingerbachmairconstructionslides.pdf|Ganzinger-Bachmair Model Construction}} | * {{:ganzingerbachmairconstructionslides.pdf|Ganzinger-Bachmair Model Construction}} | ||
- | * [[http://citeseer.ist.psu.edu/36219.html|Lower Bounds for Resolution and Cutting Plane Proofs and Monotone Computations]] | ||
- | * [[http://citeseer.ist.psu.edu/700371.html|The Complexity of Boolean Functions]] | ||