Foundations of Constraint Processing
the page will be regularly updated. Check it out regularly for announcements of required/recommended reading material, homework, etc.
Prereq: CSCE310, Data structures and algorithms.
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: Monday and Wednesday from 3:30 p.m. to 4:45 p.m.
Make-up Class/Recitation: Monday from 5:00 p.m. to 5:50 p.m.
Instructor: Prof. Berthe Y. Choueiry
TA: Mr. Jamie Schirf
For quick response, email firstname.lastname@example.org. Your message will be forwarded to both TA and instructor.
Important note: The GTA allocated to this class does not have extensive experience in the subject matter and will mainly help with administrative matters. All questions will have to be made to the instructor during office hours, make-up class, by email, or by appointment. We will follow a `peer-correction system' by which students grade each other's (glossaries and) homework with help from the TA and under close monitoring by the instructor.
Topics include but are not restricted to:
Last modified: Wed Apr 30 13:44:53 CDT 2008 // -->