15-815 Automated Theorem Proving
Lecture 12: The First-Order Inverse Method
In this lecture we show how to generalize the inverse method from
intuitionistic propositional logic to the first-order case. The
treatment of quantifiers requires some care and places slightly
different requirements on the notion of unification than backwards
search. In particular, we will need most general unifiers and the
notion of parameter variables, that is, variables that can stand only
for parameters.
We first proceed by example and then given a presentation of
the rules that is amenable to soundness and completeness
proofs.
[ Home
| Schedule
| Assignments
| Handouts
| Software
| Resources
]
fp@cs
Frank Pfenning
|