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.

[ Home | Schedule | Assignments | Handouts | Software ]

Frank Pfenning