[ home
| schedule
| assignments
| projects
| resources
| handouts
| overview
| links
]
# 15-815 Automated Theorem Proving

# Lecture 26: Resolution

We describe more formally how proof search based on the
inverse method proceeds. It shares many characteristics with
Robinson's original resolution principle, developed for classical
logic. We also sketch the proof of the lifting lemma on this
formulation.

### Reading

- A draft chapter in the Handbook of Automated Reasoning
on
*The Inverse Method*,
pp. 13-23, 29-36

### Key Concepts

- Most general unifier
- Renaming
- Unification of substitutions
- Lifting lemma

### Links

[ home
| schedule
| assignments
| projects
| resources
| handouts
| overview
| links
]

Frank Pfenning
fp@cs