15-815 Automated Theorem Proving
Lecture 16: Inverse Focusing
After a brief sketch of the completeness proof for focusing, we
consider how to exploit focusing to construct a better inverse method
prover. The crucial insight is that phases in focusing can be
translated into derived inference rules, which avoid the creation of
many intermediate sequents. Furthermore, subformulas only need to be
named at the boundary between asynchronous and synchronous propositions.
[ Home
| Schedule
| Assignments
| Handouts
| Software
| Resources
]
fp@cs
Frank Pfenning
|