COMP 426 Automated Reasoning
Lecture 15: Inversion-based proof search

We turn the observations about the invertibility of some of the inference rules into a proof search strategy. This strategy is once again described by an inference system, but we carefully distinguish between rules for which search proceeds in a don't care non-deterministic way and those where we have to make a don't know non-deterministic choice. We combine the insights behind the inversion strategy and backchaining in the form of the focusing strategy, originally developed by Andreoli for linear logic and later generalized by Howe to the intuitionistic case.

• Reading: Chapter 4 (pages 63 - 72)
• Code: in preparation
• Previous lecture: Week 8
• Next lecture: Week 10

[ Home | Schedule | Assignments | Projects | Handouts | Software | Overview ]

bp@cs.mcgill.ca
Brigitte Pientka