PA163 Constraint programming

Faculty of Informatics
Autumn 2023
Extent and Intensity
2/1. 3 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
Taught in person.
doc. Mgr. Hana Rudová, Ph.D. (lecturer)
Mgr. Václav Sobotka (assistant)
Guaranteed by
doc. Mgr. Hana Rudová, Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Supplier department: Department of Computer Systems and Communications – Faculty of Informatics
Mon 16:00–17:50 A318
  • Timetable of Seminar Groups:
PA163/01: Thu 21. 9. 10:00–11:50 A215, Thu 12. 10. 10:00–11:50 A215, Thu 26. 10. 10:00–11:50 A215, Thu 9. 11. 10:00–11:50 A215, Thu 23. 11. 10:00–11:50 A215, Thu 7. 12. 10:00–11:50 A215, H. Rudová
PA163/02: Thu 5. 10. 10:00–11:50 A215, Thu 19. 10. 10:00–11:50 A215, Thu 2. 11. 10:00–11:50 A215, Thu 16. 11. 10:00–11:50 A215, Thu 30. 11. 10:00–11:50 A215, Thu 14. 12. 10:00–11:50 A215, 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 53 fields of study the course is directly associated with, display
Course objectives
Course provides information about constraint programming, about problem modeling using constraints generally as well as practically in programming language, about general propagating algorithms and about main search algorithms for constraint satisfaction problems.
Learning outcomes
The graduate will understand how to apply a declarative approach for problem solving with the help of constraint programming.
The graduate will understand which algorithms are used for the implementation of the constraint programming approach to be able to propose a proper declarative model and proper search procedures. To achieve that graduates will learn various constraint propagation algorithms and search methods.
The graduate will be able to implement a solution to the problem using constraint programming. The graduate will be able to program using Optimization Programming Language (OPL) from IBM CPLEX CP Optimizer.
  • Constraint satisfaction problem. Introduction to problem modeling.
  • Algorithms and consistency: arc, path. Methods for non-binary constraints: k-consistency, general arc, and bounds consistency, global constraints. Directional versions, the width of the constraint graph, and polynomial problems.
  • Tree search: backtracking, look ahead, look back, incomplete algorithms. Local search.
  • Optimization and over-constrained problems: frameworks and algorithms.
  • Problem modeling and real-life applications. Programming with programming language OPL in IBM ILOG CP Optimizer.
  • DECHTER, Rina. Constraint processing. San Francisco: Morgan Kaufmann Publishers, 2003, xx, 481 s. ISBN 1-55860-890-7. info
  • TSANG, Edward (author), FRUEHWIRTH, Thom (editor). Foundations of constraint satisfaction. Books On Demand, 2014.
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 OPL programs in IBM ILOG CP Optimizer. Seminaries include homeworks which solutions together with solutions of examples solved during seminaries are available at the course web site.
Assessment methods
There is the following expected evaluation given as a sum of points for homeworks, final written exam, and bonus points for activities at lectures: A more than 90, B 89-80, C 79-70, D 69-60, E 59-55.
It is possible to get up to 80 points for the final written exam. The exam also includes the following types of questions: an overview of some part, comparisons of methods or definitions, algorithms, definitions, and examples (about 25 points corresponds to the evaluation of the constraint model for a given problem(s)).
It is obligatory to get more than 40 out of 80 points. There are two homeworks during the semester. It is possible to get points up to 10 points per homework. Each student is required to obtain 8 points at least from the total point of 20 points.
Also, each student can get 1 bonus point for an activity in each lecture (e.g., student response to several easy questions and/or student questions to clarify some part of the lecture; student response to one harder question), i.e., it is possible to about 12 bonus points for activity base on the number of lectures.
Taking seminaries is obligatory. Absence at more than one seminar requires successful completion of additional examples corresponding to the number of absent hours. A high number of missed seminaries does not allow completion of the course.
Language of instruction
Follow-Up Courses
Further Comments
Study Materials
The course is taught annually.
Teacher's information
The course is also listed under the following terms Autumn 2003, 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.
  • Enrolment Statistics (recent)
  • Permalink: