15-851
Computation & Deduction
Spring 1997
Frank Pfenning

Lecture 22: Resolution

This guest lecture given by Iliano Cervesato

In this lecture we give a broad overview of logic programming and its proof-theoretic foundation.
	Topics:
	- Broad picture on logic programming
	  * path from a logic to an abstract machine:
	    . sequent calculus -> cut elimination -> axiom expansion
	    . natural deduction -> normalization -> atomic middlepoint
	    . uniform provability
	    . interpretation: resolution, non-determinism, abstract machine
	    . hints at compilation (non-determinism, WAM)
	  * conservation of provability / conservation of proofs
	  * pointer to notes: I don't think there is a single point in the
	    notes where this is addressed as a whole
	  * code: no code on this
	- Implementation of uniform provability
	  * pointer to notes: Section 8.1
	- Resolution
	  * motivations
	  * enriched goal language, duality of the "new" connectives w.r.t.
	    the "old" ones
	  * deductive system for resolution
	  * pointer to notes: Section 8.5
	  * code: no code used
  • next lecture
  • previous lecture

  • [ C&D Home | Schedule | Code | Assignments | Notes | Projects | Elf ]

    © Frank Pfenning 1992-1997
    fp@cs