Foundations of Constraint Processing
the page will be regularly updated. Check it out regularly for announcements of required/recommended reading material, homework, etc.
Prereq: Instructor's permission
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 goal of this course is to prepare students to conduct research in this area. The course will be intensive and will require thorough study of the theory and the algorithms, and a significant implementation effort. Students are expected to be self motivated, and demonstrate intellectual independence and collegial collaboration.
Lectures: Monday, Wednesday, Friday, 3:30 p.m. to 4:20 p.m.
Make-up Class/Recitation: Monday, from
Instructor: Prof. Berthe Y. Choueiry
Mr. Robert Woodward
For a quick response, send your questions to Piazza. Your message will be read by the TA and the instructor and they will respond to you ASAP.
Topics include but are not restricted to:
Last modified: Wed Aug 22 15:10:35 CDT 2012