Constraint ProgrammingLectures:24 h Recommended forGraduate students. The course was last given:Spring 1999. GoalsThe main goal of this course is to give an introduction to a new programming paradigm based on constraints over different domains, such as real (rational) numbers or finite domains. Special emphasis will be put on the practical use of these methods, in particular for solving combinatorial optimization problems. PrerequisitesBasic course in programming. Knowledge of Prolog is an advantage but a short introduction to Prolog can be organized if needed. OrganizationLectures given by the teachers and seminars prepared by the participants. Programming assignments on the selected topics. Contents
LiteratureKim Mariott and Peter J. Stuckey "Programming with Constraints: An Introduction", The MIT Press, 1998. Selected papers and manuals. TeachersUlf Nilsson, Jan Maluszynski ExaminerUlf Nilsson/Jan Maluszynski ScheduleFall 2001. ExaminationProgramming assignments. Credit4-6 credits. |
Page responsible: Anne Moe