15816 Linear Logic
Lecture 11: Unification
Focusing removes some unnecessary nondeterminism from search,
but other sources of inefficiency remain. In this lecture we
talk about how to resolve existential nondeterminism which
arises in the choice of a substitution for the existential right
or universal left rule.
The nondeterminism is resolved by substitution an existential
variable (also called metavariable or logic variable) and
then collecting constraints on this variable. Solving these
constraints is referred to as unification. Unification
is at the heart of almost all theorem provers and logic programming
languages.
We present the relationship between search and unification
using residuation which collects constraints in
the form of a proposition in a simpler logic. Propositions
in this simpler logic can be solved by unification. Time permitting,
we will give a new presentation of a unification algorithm
in linear logic (presently not in the notes).
[ Home
 Schedule
 Assignments
 Handouts
 Software
 Resources
]
fp@cs
Frank Pfenning
