Computer Science 490CA $\bullet$ Constraint Processing
 
 

Course Outline $\bullet$ Winter 2008

 
 
 
 
 

Instructor:	Dr M. Mouhoub		Office: CW 308.13
Method of Evaluation:	Project(report+code+presentation)	70%
	Final Exam	30%

Recommended Documentation

• Foundations of Constraint Satisfaction, Tsang, E.P.K, Academic Press, London and San Diego, 1993.
• On-line guide to constraint programming by Roman Barták.
• Algorithms for Constraint Satisfaction Problems: A Survey, Kumar, AI Magazine 13(1):32-44, 1992.

Topics

• Constraint Satisfaction Techniques: Arc consistency, Path Consistency, solution search strategies, heuristic search, partial constraint satisfaction techniques.
• Temporal Reasoning: Point Algebra, Interval Algebra, Temporal Constraint Satisfaction Problems.
• Approximation and Stochastic Algorithms: Local Search, Hill-Climbing, Min-Conflicts, Tabu-Search, GSAT.