This is an old revision of the document!
Interpolation for Propositional Logic
Definition of Interpolant:
Given two propositional formulas and , an interpolant for is a propositional formula such that:
1)
2)
3)
Note that by transitivity of . The interpolant extracts what makes imply .
Let denote the operator that eliminates propositional quantifiers (see QBF and Quantifier Elimination).
Here are two simple ways to construct an interpolant:
- We can quantify existentially all variables in that are not in .
where
- We can quantify universally all variables in that are not in .
where
More precisely, let denote the set of all interpolants for , that is, \[
{\cal I}(F,G) = \{ H \mid H \mbox{ is interpolant for $(F,G)$ \}
\] Then the following properties hold:
We can also derive interpolants from resolution proofs, as we will see in lecture07.