15-815 Automated Theorem Proving
Lecture 11: A Focusing Prover
We review the idea of focused search and present the ML code
for a simple propositional focusing prover. It is based on
fixing the don't-care non-deterministic choices simply based
on the order of assumptions and solving don't-know non-determinism
through bounded depth-first search and iterative deepening.
- Handout 8 on Focused
Derivations, pages 65-67 (also availabe in PDF format).
- Slides from the lecture.
- Browse several implementations of a simple
theorem prover for propositional
intuitionistic logic using focusing derivation (or
retrieve as gzipped tar file).
- Focused derivations
- Success continuations
- Depth-first search
- Bounded iterative deepening