PA163 Constraint programming

Faculty of Informatics
Autumn 2007
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. Václav Matyáš, M.Sc., Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Timetable
Thu 8:00–9:50 B204 and each odd Tuesday 10:00–11:50 X Datový projektor, each odd Tuesday 10:00–11:50 B116
  • Timetable of Seminar Groups:
PA163/02: each even Tuesday 10:00–11:50 X Datový projektor, each even Tuesday 10:00–11:50 B116, H. Rudová
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
there are 19 fields of study the course is directly associated with, display
Course objectives
The course studies the area of constraint satisfaction. Various general algorithms from the areas like artificial intelligence or optimization are also presented. 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. Seminaries are devoted to the training of practical examples in constraint logic programming with computer.
Syllabus
  • Constraint satisfaction problem. Introduction to problem modelling. Constraint representation. Complexity.
  • Algorithms and consistency: arc, path. Methods for non-binary constraints: k-konsistency, general arc and bounds consistency, global constraints. Directional versions, width of constraint graph and polynomial problems.
  • Tree search: backtracking, look ahead, look back, incomplete algorithms. Local search.
  • Optimization and over-constrained problems: frameworks and algorithms.
  • Dynamic and distributed constraint satisfaction problems.
  • Constraint logic 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
  • Edward, Tsang. Foundations of constraint satisfaction. Academic Press Ltd., 1993.
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.
Language of instruction
Czech
Follow-Up Courses
Further comments (probably available only in Czech)
Study Materials
The course is taught annually.
Teacher's information
http://is.muni.cz/elearning/warp.pl?fakulta=1433;obdobi=3724;kod=PA163;qurl=/el/1433/podzim2007/PA163/index.qwarp
The course is also listed under the following terms Autumn 2003, Autumn 2004, Autumn 2005, Autumn 2006, 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 2007, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2007/PA163