PA163 Constraint programming

Fakulta informatiky
podzim 2023
Rozsah
2/1. 3 kr. (plus ukončení). Ukončení: zk.
Vyučováno prezenčně.
Vyučující
doc. Mgr. Hana Rudová, Ph.D. (přednášející)
Mgr. Václav Sobotka (pomocník)
Garance
doc. Mgr. Hana Rudová, Ph.D.
Katedra počítačových systémů a komunikací – Fakulta informatiky
Dodavatelské pracoviště: Katedra počítačových systémů a komunikací – Fakulta informatiky
Rozvrh
Po 16:00–17:50 A318
  • Rozvrh seminárních/paralelních skupin:
PA163/01: Čt 21. 9. 10:00–11:50 A215, Čt 12. 10. 10:00–11:50 A215, Čt 26. 10. 10:00–11:50 A215, Čt 9. 11. 10:00–11:50 A215, Čt 23. 11. 10:00–11:50 A215, Čt 7. 12. 10:00–11:50 A215, H. Rudová
PA163/02: Čt 5. 10. 10:00–11:50 A215, Čt 19. 10. 10:00–11:50 A215, Čt 2. 11. 10:00–11:50 A215, Čt 16. 11. 10:00–11:50 A215, Čt 30. 11. 10:00–11:50 A215, Čt 14. 12. 10:00–11:50 A215, H. Rudová
Omezení zápisu do předmětu
Předmět je nabízen i studentům mimo mateřské obory.
Mateřské obory/plány
předmět má 53 mateřských oborů, zobrazit
Cíle předmětu
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.
Výstupy z učení
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.
Osnova
  • 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.
Literatura
  • 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.
Výukové metody
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.
Metody hodnocení
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.
Vyučovací jazyk
Angličtina
Navazující předměty
Informace učitele
http://is.muni.cz/el/1433/podzim2023/PA163/index.qwarp
Další komentáře
Studijní materiály
Předmět je vyučován každoročně.
Předmět je zařazen také v obdobích podzim 2003, podzim 2004, podzim 2005, podzim 2006, podzim 2007, podzim 2008, podzim 2009, podzim 2010, podzim 2011, podzim 2012, podzim 2013, podzim 2014, podzim 2015, podzim 2016, podzim 2017, podzim 2018, podzim 2019, podzim 2020, podzim 2021, podzim 2022.
  • Statistika zápisu (nejnovější)
  • Permalink: https://is.muni.cz/predmet/fi/podzim2023/PA163