CSCE990-06, Spring 2003: Advanced Constraint Processing

Prereq:         CSCE821, or equivalent.

Course description: This course is a continuation of the course on Foundations of Constraint Processing (CSCE 821). It is intended for students with some sophistication and considerable interest in exploring methods of designing and using algorithms useful for solving combinatorial problems. The goal of the course will be to study, analyze and critique basic and current research papers and to engage in Constraint Processing projects and experiments either alone or in small groups.
    Topics may include (and are not restricted to)

  • non-binary constraints,
  • over-constrained problems,
  • temporal reasoning,
  • symmetry and interchangeability,
  • continuous CSPs,
  • distributed constraint satisfaction,
  • constraints in relational databases,
  • spatial reasoning, etc.
  •     Class participation is essential.
        The content of this course is modified every time it is offered.

        Warning: The format of the course is significantly more
    like a research seminar than a regular class.
    Be prepared for intensive work and mature interactions.


    Time:                 Monday, Wednesday, from  2:30 to 3:45 p.m.

    Place:                 CBA 104 (room changed on January 22, 2003)

    Instructor:      Prof. Berthe Y. Choueiry
                                Room 104, Ferguson Hall
                                choueiry@cse.unl.edu
                                Tel: (402)472-5444

    Office hours:   Monday, Wednesday 3:45--4:45 p.m.  or by appointment

    Important:      Regularly check out the page of class schedule for reference to required and recommended reading material, homework texts, and announcements.

    Protocol of the course:

  • Study of selective chapters of the manuscript on Constraint Processing by Rina Dechter.
  • Mainly discussions of technical papers, otherwise lectures by the instructor and presentations by students.
  • Absence:  maximum 3 sessions, advanced notice required.
  • Collaboration and discussion within and outside the classroom strongly encouraged unless specified (e.g., for assignments, quizzes, or riddles').
  • Grading policy: How can I improve my grade? Grade conversion:
     
    >97%
    A+
    94--96
    A
    90--93
    A-
     87--89
    B+
    84--86
    B
    80--83
    B-
    75--79
    C+
    67--74
    C
    60--66
    C-
    57--59
    D+
    54--56
    D
    51--53
    D-
    <=50
    F

    Textbooks:

  • We will use selective chapters of the manuscript "Constraint Processing" of Rina Dechter.
  • We will also heavily rely on technical papers from the literature. As the need arises, copies will be made available by, or can be retrieved from, the instructor.
  • Additional reference (available on reserve from LL): Foundations of Constraint Satisfaction by Edward Tsang.

  •  

     
     
     
     
     

    Main AI textbooks are available on reserve for CSCE 476/876 at the Love Library (but you are welcome to check them out):
    AI:

    LISP:
  • Specific topics:
  • Some research groups involved in Constraint Processing:
    Archives and on-line systems: Conferences:
    Berthe Y. Choueiry