15-317 Constructive Logic
Lecture 14: 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: lp:01-lp.pdf
  • Previous lecture: Arithmetic
  • Next lecture: Control Constructs
  • Key concepts:
    • Computation as proof search
    • Clause order
    • Subgoal order
    • Backtracking
    • Answer substitutions
    • Unification

[ Home | Schedule | Assignments | Handouts | Software ]

fp@cs
Frank Pfenning