First cycle
degree courses
Second cycle
degree courses
Single cycle
degree courses
School of Science
COMPUTER SCIENCE
Course unit
CONSTRAINT REASONING
SC03111906, A.A. 2015/16

Information concerning the students who enrolled in A.Y. 2015/16

Information on the course unit
Degree course Second cycle degree in
COMPUTER SCIENCE
SC1176, Degree course structure A.Y. 2014/15, A.Y. 2015/16
N0
bring this page
with you
Number of ECTS credits allocated 6.0
Type of assessment Mark
Course unit English denomination CONSTRAINT REASONING
Website of the academic structure http://informatica.scienze.unipd.it/2015/laurea_magistrale
Department of reference Department of Mathematics
Mandatory attendance No
Language of instruction Italian
Branch PADOVA
Single Course unit The Course unit can be attended under the option Single Course unit attendance
Optional Course unit The Course unit can be chosen as Optional Course unit

Lecturers
Teacher in charge MICHELE LOMBARDI

ECTS: details
Type Scientific-Disciplinary Sector Credits allocated
Core courses INF/01 Computer Science 6.0

Course unit organization
Period First semester
Year 1st Year
Teaching method frontal

Type of hours Credits Teaching
hours
Hours of
Individual study
Shifts
Practice 1.0 6 19.0 No turn
Lecture 5.0 38 87.0 No turn

Calendar
Start of activities 01/10/2015
End of activities 28/01/2016
Show course schedule 2019/20 Reg.2014 course timetable

Examination board
Examination board not defined

Syllabus
Prerequisites: None.
Target skills and knowledge: Main subject of this course is constraint programming, both from a theoretical and from a practical point of view. Constraint programming
is an rea which lies between
Artificial Intelligence, Operational Research, Programming Languages, and Databases, and provides tools to model and solve real-life
problems when they can be cast as a set of constraints over a set of variables.
Examination methods: Written exam plus a practical project.
Assessment criteria: The written examination includes questions that allow to evaluate the level of comprehension of the notions taught during the course. The project allows students to deepen some notions and to see their pratical use in some (simulated) problems.
Course unit contents: * Introduction to the course, examples of constraint problems.
* Basic notions about constraint programming.
* Some complete solvers.
* Notions of local consistency.
* Some incomplete solvers.
* Algorithms for constraint propagation.
* Search methods in the solution space.
* Advanced subjects on constraint programming: soft constraints, bipolar constraints, constraints with uncertainty
Planned learning activities and teaching methods: Lectures and exercises in the classroom.
Additional notes about suggested reading: The slides used during the course will be made available to the students.
Textbooks (and optional supplementary readings)
  • Apt, Krzysztof R., Principles of constraint programming. Cambridge [etc.]: Cambridge University Press, 2003. Cerca nel catalogo
  • Dechter, Rina; Cohen, David, Constraint processing. San Francisco [etc.]: Morgan Kaufmann, 2003. Cerca nel catalogo
  • Rossi, Francesca; Beek, Peter : van der; Walsh, Peter, Handbook of constraint programming. Amsterdam: Elsevier, 2006. Cerca nel catalogo