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
Next revision Both sides next revision
sav08:lecture07 [2008/03/12 12:54]
vkuncak
sav08:lecture07 [2008/03/12 13:29]
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 19: Line 21:
 [[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]].