General Information

Wiki page

Prereq: CSCE 421/821: Foundations of Constraint Processing.

Course description: This course is a continuation of the course on Foundations of Constraint Processing (CSCE 421/821). It is intended for students with some sophistication and considerable interest in exploring methods for designing and using algorithms useful for solving combinatorial problems. The goal of the course is to study, analyzem and critique basic and current research papers. Projects are optional. Topics may include (and are not restricted to):

• Temporal reasoning,
• Symmetry and interchangeability,
• Spatial reasoning,
• Continuous CSPs,
• Distributed constraint satisfaction,
• Global constraints,
• Soft constraints,
• OR Methods in CP,
• etc.

Active class participation is an essential component of the course.

Lectures: Mondays and Wednesdat, from 3:30 p.m. to 4:45 p.m.
Location: Avery Hall, Room 109.

Make-up Class: To be scheduled as necessary

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

For a quick response, please use Piazza for all communications.

Textbooks (check the bookstore):

• Required: Constraints Processing, Rina Dechter, Morgan Kauffman, 2003.
• Required: Handbook of Constraint Programming, Rossi et al., Editors, Elsevier, 2006.
• Papers are available from the UNL libraries (electronic resources, Math Library, etc.).