[ home
| schedule
| assignments
| projects
| resources
| handouts
| overview
| links
]
15-815 Automated Theorem Proving
Lecture 9: Inversion Proofs
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.
Reading
- Pages 57-59 of Handout 7 on
Inversion Proofs (also availabe in PDF format).
Key Concepts
- Left and right passive propositions
- Don't care and don't know non-determinism
- Conjunctive and disjunctive non-determinism
Links
[ home
| schedule
| assignments
| projects
| resources
| handouts
| overview
| links
]
Frank Pfenning
fp@cs