15-815 Automated Theorem Proving
Lecture 21: Paramodulation

In backward reasoning for intuitionistic logic equality can be handled by simultaneous rigid E-unification which, unfortunately, is undecidable. Much less is known about forward calculi such as the inverse method. We therefore review some basic notions about equality reasoning in classical resolution, starting with paramodulation, the first approach toward eliminating equality axioms from (classical) resolution.

[NR01] Robert Nieuwenhuis and Alberto Rubio.
Paramodulation-based theorem proving.
Handbook of Automated Reasoning, Vol.1, pp.371-444, Elsevier Science and MIT Press, 2001.

[ Home | Schedule | Assignments | Handouts | Software | Resources ]

Frank Pfenning