PA163 Constraint programming

Faculty of Informatics
Autumn 2003
Extent and Intensity
2/0. 2 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
Teacher(s)
doc. Mgr. Hana Rudová, Ph.D. (lecturer)
Guaranteed by
prof. RNDr. Luděk Matyska, CSc.
Department of Machine Learning and Data Processing – Faculty of Informatics
Timetable
Thu 9:00–10:50 X Datový projektor, Thu 9:00–10:50 B007
Course Enrolment Limitations
The course is only offered to the students of the study fields the course is directly associated with.
fields of study / plans the course is directly associated with
Course objectives
The course studies the area of constraint satisfaction. Search and constraint propagation methods are represented by both classical and new algorithms. The basic techniques to the problem modelling are presented along with the application of constraints in the areas as logic programming or concurrent programming. Solving of smaller examples and modelling of real-life problems is also shown.
Syllabus
  • Constraint satisfaction problem. Binary and non-binary constraints. Constraint reprezentation. Complexity.
  • Algorithms and consistency: node, arc, path, k-consistency.
  • Tree search algorithms: backtracking, limited discrepancy search, incomplete methods, intelligent backtracking.
  • Search algorithms with constraint propagations.
  • Local search algorithms.
  • Hybrid search algorithms.
  • Global constraints: problem modelling, solution methods.
  • Optimization problems and algorithms.
  • Over-constrained problems: frameworks and algorithms.
  • Constraint logic programming. Concurrent constraint programming. Distributed constraint satisfaction. Constraint-based agents.
  • Survey of software tools, constraint programming in practical examples.
  • Problem modelling and real-life applications.
Literature
  • Dechter, Rina. Constraint Processing. Morgan Kaufmann Publishers, 2003.
  • Apt, Kryzstof R. Principles of Constraint Programming. Cambridge University Press, 2003.
  • MARRIOTT, Kim and P. J. STUCKEY. Programming with constraints : an introduction. Cambridge: MIT Press, 1998, xiv, 467. ISBN 0262133415. info
  • VAN HENTENRYCK, Pascal. Constraint Satisfaction in Logic Programming. Cambridge: Massachusetts Institute of Technology, 1989, 224 s. ISBN 0262081814. info
  • BARTÁK, Roman. On-line Guide to Constraint Programming. 2002. URL info
Assessment methods (in Czech)
Kratší písemná práce pro každý řádný termín, představuje společnou přípravu pro všechny studenty, cca 5 otázek: přehledové, algoritmy, pojmy, příklady. Ústní zkouška ve stejný den jako písemná práce, příprava na individuální otázky, během zkoušky diskuse nad písemnou prací.
Opravný termín pouze jako ústní zkouška.
Language of instruction
Czech
Further comments (probably available only in Czech)
The course is taught annually.
Teacher's information
http://www.fi.muni.cz/~hanka/cp
The course is also listed under the following terms Autumn 2004, Autumn 2005, Autumn 2006, Autumn 2007, Autumn 2008, Autumn 2009, Autumn 2010, Autumn 2011, Autumn 2012, Autumn 2013, Autumn 2014, Autumn 2015, Autumn 2016, Autumn 2017, Autumn 2018, Autumn 2019, Autumn 2020, Autumn 2021, Autumn 2022, Autumn 2023.
  • Enrolment Statistics (Autumn 2003, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2003/PA163