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