COMP 426 Automated Reasoning
Lecture 16: Implementing focusing provers
We will discuss a few possible improvements to achieve an implementation for proof search, given the inversion-based search procedure from the last lecture. The central idea, will be to chain all non-deterministic choices toghether during a focusing phase.
We will discuss three different simple-minded implementations of focusing provers; the first one relies on booleans, the second one uses tactics and tacticals, and the third one uses continuations.
[ Home
| Schedule
| Assignments
| Projects
| Handouts
| Software
| Overview
]
bp@cs.mcgill.ca
Brigitte Pientka
|