2 Matching and Proof Search

Today's lecture has two main goals:

1. To discuss the idea of matching in Prolog, and to explain how Prolog matching differs from standard unification. Along the way, we'll introduce =, the built-in Prolog predicate for matching.

2. To explain the search strategy Prolog uses when it tries to prove something.

• 2.1 Matching
  • 2.1.1 Examples
  • 2.1.2 The occurs check
  • 2.1.3 Programming with matching

• 2.2 Proof Search

• 2.3 Exercises

• 2.4 Practical Session 2