PA163 Constraint programming

Faculty of Informatics
Autumn 2009
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)
RNDr. Dalibor Klusáček, Ph.D. (assistant)
Guaranteed by
prof. RNDr. Václav Matyáš, M.Sc., Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Timetable
Mon 12:00–13:50 B410
  • Timetable of Seminar Groups:
PA163/01: each odd Thursday 10:00–11:50 B116, H. Rudová
PA163/02: each even Thursday 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 26 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 modeling are presented along with the application of constraints. Seminaries are devoted to the training of practical examples in constraint logic programming with computer (there are no prerequisites concerning logic programming).
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. San Francisco: Morgan Kaufmann Publishers, 2003, xx, 481 s. ISBN 1-55860-890-7. info
  • Edward, Tsang. Foundations of constraint satisfaction. Academic Press Ltd., 1993.
Teaching methods
The course has a form of a lecture with a seminar taking two hours per two weeks at the computer laboratory. Lecture is mainly oriented on presentations of algorithms and their practical application for solving of problems in the area of constraint programming. Solved problems are often realized using modifications of existing code. Seminaries concern namely practical realization of CLP(FD) programs in SICStus Prolog. Seminaries include homeworks which solutions together with solutions of examples solved during seminaries are available at the course web site.
Assessment methods
Examination consists of the final written exam evaluated by 100 points and completion of a course requires 55 points at least (A: 100-90, B 89-80, C 79-70, D 69-60, E59-55). About 33% of the points corresponds to evaluation of the constraint model for given problem(s). The exam also includes following types of questions: overview of some part, comparisons of methods or definitions, algorithms, definitions, examples. Taking of seminaries is obligatory. Absence at more than seminar requires successful completion of additional examples corresponding to the number of absent hours.
Language of instruction
Czech
Follow-Up Courses
Further Comments
Study Materials
The course is taught annually.
Teacher's information
https://is.muni.cz/el/1433/podzim2009/PA163/index.qwarp
The course is also listed under the following terms Autumn 2003, Autumn 2004, Autumn 2005, Autumn 2006, Autumn 2007, Autumn 2008, 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, Autumn 2024.
  • Enrolment Statistics (Autumn 2009, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2009/PA163