PA163 Constraint programming

Fakulta informatiky
podzim 2024
Rozsah
2/1/0. 3 kr. (plus ukončení). Ukončení: zk.
Vyučováno kontaktně
Vyučující
doc. Mgr. Hana Rudová, Ph.D. (přednášející)
Mgr. Marek Toma (cvičící)
Garance
doc. Mgr. Hana Rudová, Ph.D.
Katedra strojového učení a zpracování dat – Fakulta informatiky
Dodavatelské pracoviště: Katedra strojového učení a zpracování dat – Fakulta informatiky
Rozvrh
Po 23. 9. až Po 16. 12. Po 16:00–17:50 A217
  • Rozvrh seminárních/paralelních skupin:
PA163/01: Pá 4. 10. až Pá 13. 12. každý sudý pátek 10:00–11:50 A215, H. Rudová
PA163/02: Pá 27. 9. až Pá 20. 12. každý lichý pátek 10:00–11:50 A215, H. Rudová
PA163/03: Út 24. 9. až Út 17. 12. každé liché úterý 10:00–11:50 A215, M. Toma
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á 29 mateřských oborů, zobrazit
Cíle předmětu
The course provides information about constraint programming, problem modeling using constraints generally and practically in a programming language, general propagating algorithms, and 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.
  • Arc consistency.
  • Path consistency.
  • Constraint propagation for non-binary constraints.
  • Global constraints, Optimization Programming Language OPL.
  • Constraint propagation algorithms for scheduling.
  • Directional consistency, graph width.
  • Look-ahead algorithms, branch & bound.
  • Look-back algorithms.
  • Incomplete search.
  • Local search.
  • Seminars: 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
Výukové metody
The course has the form of a lecture with a seminar taking two hours every two weeks at the computer laboratory. Lectures are mainly oriented on presentations of algorithms and their practical application for solving problems in the area of constraint programming. Seminars concern namely practical realization of OPL programs in IBM ILOG CP Optimizer. They include examples of which solutions are available on the course website. Solved problems are often realized using modifications of existing code.
Metody hodnocení
There is the following expected evaluation given as a sum of points for homeworks, final 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 exam (getting more than 40 points obligatory). The exam consists of the theoretical part (55 points) with the following types of questions: an overview of some parts, comparisons of methods or definitions, algorithms, definitions, and examples, and the programming part on computers (25 points) where a practical problem is solved in OPL.
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 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 seminars is obligatory. Absence at more than one seminar requires successfully completing additional examples corresponding to the number of absent hours. A high number of missed seminars does not allow completion of the course.
Vyučovací jazyk
Angličtina
Informace učitele
http://is.muni.cz/el/1433/podzim2024/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, podzim 2023.
  • Statistika zápisu (nejnovější)
  • Permalink: https://is.muni.cz/predmet/fi/podzim2024/PA163