Basic Concepts and Algorithms in Constraint Processing
the page will be regularly updated. Check it out regularly for announcements of required/recommended reading material, homework, etc.
Prereq: CSCE 235, Discrete Sctrucutures
Course description: Constraint satisfaction has emerged as a powerful approach to articulate and solve many problems in computer science, engineering, and management. It is now the basis for new programming languages and innovative commercial systems for production scheduling, product configuration, personnel planning and timetabling, etc. The course will review the foundations of constraint satisfaction and the basic mechanisms for constraint propagation. It will cover aspects of modeling and representation, and will examine islands of tractability and methods for theoretical and empirical evaluation of problem `difficulty.' If time permits, we will examine new methods for decomposition and symmetry identification, designed to overcome the complexity barrier and to support interactions with users.
Lectures: Tuesday 5:00--6:15 pm and Friday 3:00 p.m.--4:15 p.m.
Instructor: Prof. Berthe Y. Choueiry
GTA: Mr. Shant Karakashian
For quick response, email firstname.lastname@example.org. Your message will be forwarded to both TA and instructor.
Topics include but are not restricted to:
Last modified: Fri Aug 28 17:11:41 CDT 2009