Introduction to constrains, propagation techniques including local consistency. Partial instantiation search for solving finite domain CSPs. Generic backtracking and various improvements. No-good learning during search and a unified view of backtracking algorithms. The relationship between resolution proofs and backtracking search.
Constraint Networks a graphical view of binary constraint problems.
The Dual and Hidden transformations. Symmetry the use of local propagators and special constraints. Lower bounds on the length of resolution proofs and the implications for backtracking search. Integer Programming and branch and bound techniques in CSPs. Some errata fixed in the latest version of the lecture files.