Computer Science 3990 $\bullet$ Constraint Programming

Course Outline $\bullet$ Spring 2001

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

Required prerequisites: CS3750 and CS3620.

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.