15-317 Constructive Logic
Lecture 22: Imperative Logic Programming

In this lecture we extend bottom-up logic programming so it can express state change. We accomplish this by distinguishing persistent facts from those that are ephemeral (also called linear). We use blocks-world planning and execution of assembly code as example programs, as well as a simple program for list permutation.

  • Reading:
  • Previous lecture: Stratification
  • Next lecture: Linear Logic
  • Key concepts:
    • Ephemeral and persistent propositions
    • Bottom-up linear logic programmming
    • Blocks-word planning
    • Machine computation

[ Home | Schedule | Assignments | Handouts | Software ]

Frank Pfenning