Constraint Programming (CP) is a technology for declarative modeling and solving of combinatorial optimization problems. Despite (wrong) belief in some research communities, CP is not equivalent to simple enumeration...
Constraint Programming (CP) is a technology for declarative modeling and solving of combinatorial optimization problems. Despite (wrong) belief in some research communities, CP is not equivalent to simple enumeration. The real power behind CP is in the integration of search and inference realized via various consistency techniques. This integration gives CP a unique capability to exploit both user-defined heuristics as well as general powerful search-pruning techniques.
The presentation will introduce constraint satisfaction terminology and technology using a popular well-known puzzle. Then it will focus on so called global constraints that represent a “backdoor” for adding specific efficient solving techniques into general constraint solvers. The presented ideas will be motivated by real-life examples originated mainly from planning and scheduling problems.
Roman Barták works as a full professor at Charles University in Prague, Faculty of Mathematics and Physics, where he leads the Constraint Satisfaction and Optimisation Research Group.
In 1999-2004 he led research activities of a multinational company Visopt BV, where he was the main architect of the scheduling engine developed by this company. His work focuses on techniques of constraint satisfaction and their application to planning, scheduling, and other areas. Since 1998 he has been teaching a course on Constraint Programming at Charles University, he gave several tutorials on constraint processing at international conferences (IJCAI, AAAI, ICAPS, CI, SAC) and summer schools (ESSLLI, NASSLLI) and he is an author of the On-line Guide to Constraint Programming (#2 source for Constraint Programming according to Google) and On-line Guide to Prolog Programming (#2 source for Prolog Programming according to Google).
Its program consists of a one-hour lecture followed by a discussion. The lecture is based on an (internationally) exceptional or remarkable achievement of the lecturer, presented in a way which is comprehensible and interesting to a broad computer science community. The lectures are in English.
The seminar is organized by the organizational committee consisting of Roman Barták (Charles University, Faculty of Mathematics and Physics), Jaroslav Hlinka (Czech Academy of Sciences, Computer Science Institute), Michal Chytil, Pavel Kordík (CTU in Prague, Faculty of Information Technologies), Michal Koucký (Charles University, Faculty of Mathematics and Physics), Jan Kybic (CTU in Prague, Faculty of Electrical Engineering), Michal Pěchouček (CTU in Prague, Faculty of Electrical Engineering), Jiří Sgall (Charles University, Faculty of Mathematics and Physics), Vojtěch Svátek (University of Economics, Faculty of Informatics and Statistics), Michal Šorel (Czech Academy of Sciences, Institute of Information Theory and Automation), Tomáš Werner (CTU in Prague, Faculty of Electrical Engineering), and Filip Železný (CTU in Prague, Faculty of Electrical Engineering)
The idea to organize this seminar emerged in discussions of the representatives of several research institutes on how to avoid the undesired fragmentation of the Czech computer science community.
© 2013-2022, Prague Computer Science Seminar 
This work is licensed under aCreative Commons Attribution 4.0 International License.
