Foundations of Constraint Programming

From International Center for Computational Logic

Foundations of Constraint Programming

Course with SWS 1/1/0 (lecture/exercise/practical) in WS 2019

Lecturer

Tutor

SWS

  • 1/1/0

Modules

Examination method

  • Written exam



News

  • 1st Exercise Sheet is online

Description

Many natural computation problems can be formulated as constraint satisfaction problems: given a finite set of variables and a finite set of constraints, the question is whether there is a solution that satisfies all conditions. For which types of constraints can CSPs be solved efficiently, and with which algorithms? For which CSPs can such algorithms not exist?
  • Krzysztof Apt. Constraint Programming, Cambridge University Press. 2003.

Subscribe to events of this course (icalendar)

Lecture Introduction DS6, October 14, 2019 in APB E005 File
Exercise Tutorial DS6, October 21, 2019 in APB E005 File
Lecture CSP in a Nutshell DS6, October 28, 2019 in APB E005 File
Exercise Tutorial DS6, November 4, 2019 in APB E005 File
Lecture Complete Constraint Solvers DS6, November 11, 2019 in APB E005 File
Exercise Tutorial DS6, November 18, 2019 in APB E005 File
Lecture Local Consistency DS6, November 25, 2019 in APB E005 File
Exercise Tutorial DS6, December 2, 2019 in APB E005 File
Lecture Incomplete Constraint Solvers DS6, December 9, 2019 in APB E005 File
Exercise Tutorial DS6, December 16, 2019 in APB E005 File
Lecture Constraint Propagation DS6, January 6, 2020 in APB E005 File
Lecture Search DS6, January 13, 2020 in APB E005 File
Exercise Tutorial DS6, January 20, 2020 in APB E005 File
Lecture Q&A DS6, February 3, 2020 in APB E005


Calendar