LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
sav08:lecture07 [2008/03/12 12:55]
vkuncak
sav08:lecture07 [2009/04/03 15:47]
vkuncak
Line 8: Line 8:
   * 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 some SAT solving techniques   * discuss some SAT solving techniques
 +
 +===== Topics =====
  
 [[Satisfiability of Sets of Formulas]] [[Satisfiability of Sets of Formulas]]
Line 20: Line 22:
  
 [[Polynomial Algorithm for Horn Clauses]] and Boolean Constraint Propagation [[Polynomial Algorithm for Horn Clauses]] and Boolean Constraint Propagation
 +
 +[[wp>​Schaefer'​s dichotomy theorem]]
  
 Continued in [[lecture08]]. Continued in [[lecture08]].
Line 28: Line 32:
   * [[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}}