=============== Exam study guidelines ===============
The exam will cover what you have seen during the lectures and the
corresponding material in the book as well as the assignments. You
should base your preparation on the slides and study the book for more
details.
The exam is a closed book exam. No written or printed material is
allowed.
You do not have to memorise each constraint in
Koalog/SICStus/FaCiLe. Instead, you may write models in any pseudo
constraint language you like (as you have seen during the lectures) as
long as it is clear what you mean.
Below are some more specific study guidelines for each day:
Day 1-2: Read the slides and the chapters in the book.
* Important concepts: CSPs, COPs, constraints, solutions,
modelling, symmetries, search heuristics.
Day 3: Read the slides and the chapter in the book.
* Important concepts: Modelling, reified constraints, redundant
variables and channeling constraints, symmetries (again).
* Less important in book: 9.2-9.7 (except 9.5.4)
Day 4-5: Read the slides and the chapters in the book.
* Important concepts: Different kinds of consistency, constraint
graphs, width of constraint graphs, propagation, fixed points
(basics), constraint solvers (only roughly how a constraint
solver works).
Day 6: Read the slides and the chapter in the book.
* Important concepts: (Complete and reduced) labeling trees,
different kinds of prop labeling trees, search algorithms
(backtrack search, branch and bound).
* Less important in book: 8.9
Day 7: Read the slides
* Important concepts: The global constraints mentioned, matrix
models.
Day 8: Guest lecture not covered in the exam.
Day 9: Read the slides and the part in the book.
* Important concepts: Bounds consistency, propagation algorithms
for linear equality and alldifferent.
Day 10: Read the slides and the part in the book.
* Important concepts: Basics of local search, configurations,
transition functions, neighbourhoods, cost functions.