PA163 Constraint programming

Faculty of Informatics
Autumn 2004
Extent and Intensity
2/1. 3 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
Fri 10:00–11:50 A107, Fri 12:00–12:50 B311
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
there are 7 fields of study the course is directly associated with, display
Course objectives
The course studies the area of constraint satisfaction. Constraint propagation and search 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 object oriented programming. Solving of smaller examples and modelling of real-life problems is also shown. Seminaries are devoted to the training of practical examples in constraint programming with computer.
Syllabus
  • Constraint satisfaction problem. Introduction to problem modelling. Constraint representation. Complexity.
  • Algorithms and consistency: arc, path, k-consistency. Directional versions, width of constraint graph and polynomial problems. Global constraints and consistency algorithms.
  • Tree search: backtracking, look ahead, look back, incomplete algorithms. Local and hybrid search.
  • Optimization and over-constrained problems: frameworks and algorithms.
  • Constraint logic and object-oriented constraint programming.
  • Problem modelling and real-life applications.
Literature
  • DECHTER, Rina. Constraint processing. Online. San Francisco: Morgan Kaufmann Publishers, 2003. xx, 481 s. ISBN 1-55860-890-7. [citováno 2024-04-24] info
  • APT, Krzysztof R. Principles of constraint programming. Online. Cambridge: Cambridge University Press, 2003. xii, 407. ISBN 0521825830. [citováno 2024-04-24] info
  • MARRIOTT, Kim and P. J. STUCKEY. Programming with constraints : an introduction. Online. Cambridge: MIT Press, 1998. xiv, 467. ISBN 0262133415. [citováno 2024-04-24] info
  • VAN HENTENRYCK, Pascal. Constraint Satisfaction in Logic Programming. Online. Cambridge: Massachusetts Institute of Technology, 1989. 224 s. ISBN 0262081814. [citováno 2024-04-24] info
  • BARTÁK, Roman. On-line guide to constraint programming. Online. 1998, [citováno 2024-04-24] http://kti.mff.cuni.cz/~bartak/constraints info
Assessment methods (in Czech)
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é, srovnávací, 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.

The written exam for each regular date. It is a preparation for all students, it includes about 5 questions: outline of certain part, comparison of some approaches, algorithms, terminology and its explanation, examples.
The oral exam in the same day as the written exam, preparation on individual questions, discussion about written exam.
Irregular dates as oral exam only.
Language of instruction
Czech
Further Comments
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 2003, 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 2004, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2004/PA163