Lab for Automated Reasoning and Analysis LARA

Propositional Proofs

This is continuation of lecture06.


  • 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



sav08/lecture07.txt · Last modified: 2009/04/03 15:47 by vkuncak
© EPFL 2018 - Legal notice