15-317 Constructive Logic
Lecture 13: Logic Programming

In this lecture we introduce an entirely different connection between logic and computation. We interpret logical rules as programs that are executed by proof search according to a fixed strategy.

• Reading: 13-lp.pdf
• Key concepts:
  • Computation as proof search
  • Clause order
  • Subgoal order
  • Backtracking
  • Answer substitutions
  • Unification
• Previous lecture: Propositional Theorem Proving
• Next lecture: Prolog

[ Home | Schedule | Assignments | Handouts | Software ]

fp@cs
Frank Pfenning