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, Wednesday, and Friday from 12:30 p.m. to 1:20 p.m.
Location: Avery Hall, Room 19.

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: Wednesday/Friday 3:30 pm- 4:30 pm or by appointment.

Communications:

  • Course WebPage: You can access all information about the course from the course WebPage. Check the course schedule to prepare for each class.
  • Blackboad: Grades are posted on Blackboard. Check them regularly and alert us about grading errors within 7 calendar days.
  • Piazza: 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.
  • Webhandin: All homework, projects, reports, etc. must be submitted via the webhandin system of CSE.
  • Anonymous Suggestion Box: You may also choose to drop us a note in the Anonymous Suggestion Box to express any opinion about the course. (You can do it also via Piazza.)

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.).



Last modified: Mon Jan 5 15:00:00 CST 2015