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 Both sides next revision
sav08:lecture07 [2008/03/11 17:27]
vkuncak
sav08:lecture07 [2008/03/11 18:24]
vkuncak
Line 2: Line 2:
  
 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]]