TUD Logo

TUD Home » ... » Teaching » Winter Term 2013-14 » Foundations of Constraint Programming

Computational Logic

Foundations of Constraint Programming

Winter Term 2013/14

Course Description

This course unit is devoted to the interplay of logic programming - and particularly answer set programming - with constraint solving, including binary constraints, constraints over finite domains and real-valued constraints.

Lecturer:  Prof. Sebastian Rudolph, Dr. Sarah Alice Gaggl

Modules:  INF-VERT2, MCL-LCP

Status:  basic unit

SWS (lecture/tutorial/practical):  1/1/0

Examination method:  written exam


  • none


There will be an additional Q&A session on Tuesday, 4th February 2014, 14:50-16:20 in room INF E005.
List of relevant topics for the exam: Topics_ExamFCP_WS2013.txt.
The lecture is scheduled for Thursday, 11:10-12:40 (DS 3) in room INF E005.

Lecture Date Time Slides
Introduction 17.10.2013 DS3 L1-Introduction.pdf
CP in a Nutshell 07.11.2013 DS3 L2-CP_in_a_Nutshell.pdf
Tutorial 1 14.11.2013 DS3 FCP2013-T1.pdf
Complete Constraint Solvers 21.11.2013 DS3 L3-Complete_Constraint_Solvers.pdf
Tutorial 2 28.11.2013 DS3 FCP2013-T2.pdf
Local Consistency 05.12.2013 DS3 L4-Local_Consistency.pdf
Tutorial 3 12.12.2013 DS3 FCP2013-T3.pdf
Incomplete Constraint Solvers 19.12.2013 DS3 L5-Incomplete_Constraint_Solvers.pdf
Tutorial 4 09.01.2014 DS3 FCP2013-T4.pdf
Incomplete Constraint Solvers ctd. 16.01.2014 DS3
Tutorial 5 23.01.2014 DS3 FCP2013-T5.pdf
Search 30.01.2014 DS3 L7-Search.pdf
Q&A 04.02.2014 DS5
Tutorial 6 06.02.2014 DS3 FCP2013-T6.pdf


  • Kim Marriott, Peter J. Stuckey. Programming with Constraints. MIT Press, 1998.
  • Martin Gebser, Roland Kaminski, Benjamin Kaufmann and Torsten Schaub. Answer Set Solving in Practice. Morgan and Claypool, 2012.
Last modified: 5th Feb 2014, 1.53 PM
Author: Dr. Sarah Gaggl