Base terminology, examples, complexity.

Graph representation. Arc consistency.

Path consistency, k-consistency.

Directional consistency, graph width, and polynomial CSPs. Generalized arc consistency and bound consistency.

Global constraints. Generalized consistency algorithm.

Look ahead.

Look back. Incomplete search I.

Incomplete search II. Local search

Constraint propagation for scheduling. Comparison of search algorithms.

Constraint optimization problem. Revision lesson.