Class schedule: the page will be regularly updated. Check it out regularly for announcements of required/recommended reading material, homework, etc.

General Information

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.
Location: Avery Hall, Room 352.

Instructor:   Prof.  Berthe Y. Choueiry
      Office location: Room 360, Avery Hall,
      choueiry AT, tel: (402)472-5444.
      Office hours: Tuesday/Thursday 2:00--3:00 p.m. or by appointment.

GTA:   Mr. Shant Karakashian
      email: shantk AT
      Office location: Room 123D, Avery Hall

"Constraint Processing" by Rina Dechter, 1st edition. The textbook will not be followed sequentially, but should be used for reference.

For quick response, email  Your message will be forwarded to both TA and instructor.

Topics include but are not restricted to:

  • Properties, computational complexity, and practical importance.
  • Global and local consistency: algorithms, properties and computational complexity.
  • Islands of tractability for minimality and global consistency.
  • Intelligent backtracking.
  • Look-ahead techniques.
  • Ordering heuristics.
  • Theoretical and empirical comparison of hybrid search algorithms.
  • Phase transition.
  • Modeling and reduction methods between representations.
  • If time permits: Decomposition. Symmetries and their approximations. Temporal constraint networks. Stochastic search. Reformulation and abstraction. Dynamic/conditional Constraint Satisfaction (CSP). Constrained Optimization Problem (COP).
  • Other, depending on class interests.


  • Rina Dechter, Constraint Processing, 2003, Morgan Kauffmann.  Available from bookstore.
  • Edward Tsang, Foundations of Constraint Satisfaction. Available from instructor and on reserve at the Math Library in Avery.
  • Technical papers given by instructor or available from the Electronic Reserve at the Love Library.

Last modified: Fri Aug 28 17:11:41 CDT 2009