Slides for the whole semester in one file will be published at the end of the semester
Slides from the lectures and seminars in one file
The outline below is preliminary, and 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.
-
Look ahead.
-
Look back. Incomplete search I.
-
Incomplete search II. Local search
-
Backmarking, dynamic backtracking. Optimization, branch & bound. Comparison of search algorithms.
-
Constraint propagation algorithms for scheduling.
-
Search strategies for scheduling.
-
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
Předchozí