COMP 426 Automated Reasoning
Lecture 20: Unification (1)
The principal new difficulty in proof search in the presence of quantifiers is how to pick terms for their instantiation. The usual solution is to postpone that choice and use free variables. Constraints that search places on the free variables are then solved by a process called unification.
We show how unification is related to proof search, and give an algorithm for solving unification problems. We will do this in two steps. This lecture will concentrate translating our general theorem proving problem into a set of constraints.
- Reading: in preparation
- Code: in preparation
- Previous lecture: Week 10
- Next lecture: Week 12
[ Home
| Schedule
| Assignments
| Projects
| Handouts
| Software
| Overview
]
bp@cs.mcgill.ca
Brigitte Pientka
|