1 Constraint satisfaction problems (CSP), examples.
2 Constraint networks, equivalent and projection networks.
3 Constraint propagation, arc consistency, path consistency, i-consistency.
4 Directional consistency and graph ordering, backtrack free search, adaptive consistency.
5 Search methods for solving CSPs, lookahead methods, dynamic variable and value ordering.
6 Lookback methods, Gaschnig's backjumping, graph based backjumping, conflict directed back jumping. Combing lookahead with lookback, learning.
7 Model based systems, model based diagnosis, truth maintenance systems, planning as CSP. Wrapping up.