15-317 Constructive Logic
Lecture 16: Propositional Theorem Proving

In this lecture we exploit logic programming in order to write a theorem prover for propositional logic. A straightforward specification using the logical rules is sound, but will in general not terminate so we need to employ one of two standard techniques: loop checking or eliminate contraction.

• Reading:
  • Two Loop Detection Mechanisms: a Comparison, TABLEAUX'97, pp.188-200, Springer LNAI 1227, 1997.
  • Contraction-free sequent calculi for intuitionistic logic, Journal of Symbolic Logic, 57:795-807, 1992.
• Previous lecture: Control Constructs
• Next lecture: Sequent Calculus
• Key concepts:
  • Backward search
  • Inversion
  • Loop checking
  • Contraction-free formulations

[ Home | Schedule | Assignments | Handouts | Software ]

fp@cs
Frank Pfenning