Slides for the whole semester in one file will be published at the end of the semester
The outline below is preliminary, slides will be added during the semester
-
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. Combining search and propagation.
-
Look back. Incomplete tree search.
-
Local search.
-
Optimization and soft constraints: models.
-
Optimization and soft constraints: algorithms. Comparison of search algorithms.
-
Revision lesson.
Exercise materials are initially available in a pre-exercise version. After both groups have completed the exercise, the full version will be posted, and source codes will be added to the initially broken links
Previous