Course Information

PA163 Constraint programming

Extent and Intensity

2/1/0. 3 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
In-person direct teaching

Teacher(s)

doc. Mgr. Hana Rudová, Ph.D. (lecturer)
Mgr. Marek Toma (seminar tutor)

Guaranteed by

doc. Mgr. Hana Rudová, Ph.D.
Department of Machine Learning and Data Processing – Faculty of Informatics
Supplier department: Department of Machine Learning and Data Processing – Faculty of Informatics

Timetable

Mon 23. 9. to Mon 16. 12. Mon 16:00–17:50 A217

• Timetable of Seminar Groups:

PA163/01: Fri 4. 10. to Fri 13. 12. each even Friday 10:00–11:50 A215, H. Rudová
PA163/02: Fri 27. 9. to Fri 20. 12. each odd Friday 10:00–11:50 A215, H. Rudová
PA163/03: Tue 24. 9. to Tue 17. 12. each odd Tuesday 10:00–11:50 A215, M. Toma

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 29 fields of study the course is directly associated with, display

Course objectives

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.

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.

Syllabus

• 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.

Literature

• DECHTER, Rina. Constraint processing. San Francisco: Morgan Kaufmann Publishers, 2003, xx, 481 s. ISBN 1-55860-890-7. info

Teaching methods

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.

Assessment methods

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.

Language of instruction

English

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://is.muni.cz/el/1433/podzim2024/PA163/index.qwarp

PA163 Constraint programming

Extent and Intensity

2/1/0. 3 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).

Teacher(s)

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

Timetable

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.

Syllabus

• 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.

Literature

• 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

English

Follow-Up Courses

• PA167 Scheduling

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://is.muni.cz/el/1433/podzim2023/PA163/index.qwarp

PA163 Constraint programming

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)

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

Timetable

Mon 12:00–13:50 A217

• Timetable of Seminar Groups:

PA163/01: Tue 13. 9. to Tue 6. 12. each odd Tuesday 10:00–11:50 A215, H. Rudová
PA163/02: Tue 20. 9. to Tue 29. 11. each even Tuesday 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.

Syllabus

• 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.

Literature

• 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

Czech

Follow-Up Courses

• PA167 Scheduling

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://is.muni.cz/el/1433/podzim2021/PA163/index.qwarp

PA163 Constraint programming

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)
Mgr. Vojtěch Sassmann (seminar tutor)

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

Timetable

Tue 14. 9. to Tue 14. 12. Tue 8:00–9:50 A217

• Timetable of Seminar Groups:

PA163/01: Thu 16. 9. to Thu 9. 12. each odd Thursday 12:00–13:50 A215, V. Sassmann
PA163/02: Thu 23. 9. to Thu 16. 12. each even Thursday 12:00–13:50 A215, V. Sassmann

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 52 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.

Syllabus

• 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.

Literature

• 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-50.
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, 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 a 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 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

Czech

Follow-Up Courses

• PA167 Scheduling

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://is.muni.cz/el/1433/podzim2021/PA163/index.qwarp

PA163 Constraint programming

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)
Mgr. Vojtěch Sassmann (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

Timetable

Wed 10:00–11:50 A218

• Timetable of Seminar Groups:

PA163/01: each odd Thursday 14:00–15:50 A215, H. Rudová
PA163/02: each even Thursday 14:00–15: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 52 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 in the Optimization Programming Language of IBM CPLEX CP Optimizer.

Syllabus

• 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.

Literature

• 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

Video and slides are available for each lecture, video conferencing is at the time of the lecture with a discussion of pre-sent questions and other questions. The lecture is mainly oriented on presentations of algorithms and their practical application for solving problems in the area of constraint programming. Seminaries concern namely practical realization of OPL programs in IBM ILOG CP Optimizer. Solved problems are often realized using modifications of existing code. Solutions of examples solved during seminaries as well as solutions to homeworks from seminaries are available at the course web site.

Assessment methods

There is the following expected evaluation given as a sum of points for homeworks, online final exam, and bonus points for activities at lectures: A more than 90, B 89-80, C 79-70, D 69-60, E 59-50.
It is possible to get up to 80 points for the online final exam, it is obligatory to get more than 40 out of 80 points. The regular date of the exam will be written and mandatory for all students. Repair exam dates will be in the form of an oral online exam.
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 2 bonus points for activity in each lecture (1 point: student response to several easy questions and/or student questions to clarify some part of the lecture, student response to one harder question; 2 points: larger interaction), i.e., it is possible to about 24 bonus points for activity base on the number of lectures.
No later than the day after the seminar, students are required to submit the codes of solved examples to the subject vault (although in some cases not fully functional). It is tolerated if the codes are submitted once by e-mail. In the case of two late submissions, it is necessary to work out a solution of additional examples. More than two late submissions are not possible for successful completion of the course.

Language of instruction

Czech

Follow-Up Courses

• PA167 Scheduling

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://is.muni.cz/el/1433/podzim2020/PA163/index.qwarp

PA163 Constraint programming

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)
Mgr. Stanislav Murín (seminar tutor)

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

Timetable

Mon 12:00–13:50 A319

• Timetable of Seminar Groups:

PA163/01: each even Wednesday 8:00–9:50 B311, S. Murín
PA163/02: each odd Wednesday 8:00–9:50 B311, 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 52 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

Graduate will understand how to apply declarative approach for problem solving with the help of constraint programming.
Graduate will understand which algorithms are used for implementation of the constraint programming approach to be able to propose a proper declarative model and proper search procedures. To achieve that graduate will learn various constraint propagation algorithms and search methods.
Graduate will be able describe solution of the problem using constraints either with the help of Optimization Programming Language.

Syllabus

• Constraint satisfaction problem. Introduction to problem modelling.
• 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.
• Problem modelling and real-life applications. Programming with programming language OPL in IBM ILOG CP Optimizer.

Literature

• 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 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-50.
It is possible to get up to 80 points for final written exam. The exam also includes following types of questions: overview of some part, comparisons of methods or definitions, algorithms, definitions, examples (about 25 points corresponds to evaluation of the constraint model for given problem(s)).
There are two homeworks during a 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 of seminaries is obligatory. Absence at more than seminar requires successful completion of additional examples corresponding to the number of absent hours. High number of missed seminaries does not allow completion of the course.

Language of instruction

Czech

Follow-Up Courses

• PA167 Scheduling

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://is.muni.cz/el/1433/podzim2019/PA163/index.qwarp

PA163 Constraint programming

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)

Guaranteed by

doc. RNDr. Eva Hladká, Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Supplier department: Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Mon 17. 9. to Mon 10. 12. Mon 12:00–13:50 A217

• Timetable of Seminar Groups:

PA163/01: each even Wednesday 10:00–11:50 B311, H. Rudová
PA163/02: each odd Wednesday 10:00–11:50 B311, 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 23 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

Graduate will understand how to apply declarative approach for problem solving with the help of constraint programming.
Graduate will understand which algorithms are used for implementation of the constraint programming approach to be able to propose a proper declarative model and proper search procedures. To achieve that graduate will learn various constraint propagation algorithms and search methods.
Graduate will be able describe solution of the problem using constraints either with the help of Optimization Programming Language.

Syllabus

• Constraint satisfaction problem. Introduction to problem modelling.
• 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.
• Problem modelling and real-life applications. Programming with programming language OPL.

Literature

• 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 ILOG. Seminaries include homeworks which solutions together with solutions of examples solved during seminaries are available at the course web site.

Assessment methods

There is following expected evaluation given as a sum of points for homeworks and final written exam: A 100 and more, B 90-99, C 80-89, D 70-79, E 60-69.
It is possible to get up to 100 points for final written exam. The exam also includes following types of questions: overview of some part, comparisons of methods or definitions, algorithms, definitions, examples (about 33% of the points corresponds to evaluation of the constraint model for given problem(s)).
There are two homeworks during a 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.
Taking of seminaries is obligatory. Absence at more than seminar requires successful completion of additional examples corresponding to the number of absent hours. High number of missed seminaries does not allow completion of the course.

Language of instruction

Czech

Follow-Up Courses

• PA167 Scheduling

Further Comments

The course is taught annually.

Teacher's information

http://is.muni.cz/el/1433/podzim2018/PA163/index.qwarp

PA163 Constraint programming

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)

Guaranteed by

doc. RNDr. Eva Hladká, Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Supplier department: Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Wed 12:00–13:50 A217

• Timetable of Seminar Groups:

PA163/01: each even Monday 10:00–11:50 B117, H. Rudová
PA163/02: each odd Monday 10:00–11:50 B117, H. Rudová
PA163/03: each even Thursday 10:00–11:50 B117, 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 23 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

Graduate will understand how to apply declarative approach for problem solving with the help of constraint programming.
Graduate will understand which algorithms are used for implementation of the constraint programming approach to be able to propose a proper declarative model and proper search procedures. To achieve that graduate will learn various constraint propagation algorithms and search methods.
Graduate will be able describe solution of the problem using constraints either with the help of Optimization Programming Language.

Syllabus

• Constraint satisfaction problem. Introduction to problem modelling.
• 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.
• Problem modelling and real-life applications. Programming with programming language OPL.

Literature

• 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 ILOG. Seminaries include homeworks which solutions together with solutions of examples solved during seminaries are available at the course web site.

Assessment methods

There is following expected evaluation given as a sum of points for homeworks and final written exam: A 100 and more, B 90-99, C 80-89, D 70-79, E 60-69.
It is possible to get up to 100 points for final written exam. The exam also includes following types of questions: overview of some part, comparisons of methods or definitions, algorithms, definitions, examples (about 33% of the points corresponds to evaluation of the constraint model for given problem(s)).
There are two homeworks during a 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.
Taking of seminaries is obligatory. Absence at more than seminar requires successful completion of additional examples corresponding to the number of absent hours. High number of missed seminaries does not allow completion of the course.

Language of instruction

Czech

Follow-Up Courses

• PA167 Scheduling

Further Comments

The course is taught annually.

Teacher's information

http://is.muni.cz/el/1433/podzim2017/PA163/index.qwarp

PA163 Constraint programming

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)

Guaranteed by

doc. RNDr. Eva Hladká, Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Supplier department: Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Mon 12:00–13:50 A318

• Timetable of Seminar Groups:

PA163/01: each even Tuesday 16:00–17:50 B311, H. Rudová
PA163/02: each odd Tuesday 16:00–17:50 B311, H. Rudová
PA163/03: each even Thursday 14:00–15:50 B311, H. Rudová

Prerequisites

For seminar group using logic programming expected knowledge in backgrounds of propositional and predicate logic, e.g. based on the course IB101.
There are no prerequisites concerning logic programming.

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 23 fields of study the course is directly associated with, display

Course objectives

Graduate will understand how to apply declarative approach for problem solving with the help of constraint programming.
Graduate will understand which algorithms are used for implementation of the constraint programming approach to be able to propose a proper declarative model and proper search procedures. To achieve that graduate will learn various constraint propagation algorithms and search methods.
Graduate will be able describe solution of the problem using constraints either with the help of optimization programming language or constraint logic programming (the choice is related with the choice of seminar group).

Syllabus

• Constraint satisfaction problem. Introduction to problem modelling.
• 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.
• Problem modelling and real-life applications. Programming with selected programming language (OPL or CLP).

Literature

• 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/CLP(FD) programs in ILOG/SICStus Prolog. Seminaries include homeworks which solutions together with solutions of examples solved during seminaries are available at the course web site.

Assessment methods

There is following expected evaluation given as a sum of points for homeworks and final written exam: A 100 and more, B 90-99, C 80-89, D 70-79, E 60-69.
It is possible to get up to 100 points for final written exam. The exam also includes following types of questions: overview of some part, comparisons of methods or definitions, algorithms, definitions, examples (about 33% of the points corresponds to evaluation of the constraint model for given problem(s)).
There are two homeworks during a 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.
Knowledge about constraint logic programming (CLP) is expected for the CLP seminar group only. Similarly knowledge about optimization programming language (OPL) is expected for the OPL seminar group only.
Taking of seminaries is obligatory. Absence at more than seminar requires successful completion of additional examples corresponding to the number of absent hours. High number of missed seminaries does not allow completion of the course.

Language of instruction

Czech

Follow-Up Courses

• PA167 Scheduling

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://is.muni.cz/el/1433/podzim2016/PA163/index.qwarp

PA163 Constraint programming

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. Pavel Troubil, Ph.D. (seminar tutor)

Guaranteed by

doc. RNDr. Eva Hladká, Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Supplier department: Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Mon 10:00–11:50 A217

• Timetable of Seminar Groups:

PA163/01: each odd Wednesday 12:00–13:50 A215, H. Rudová
PA163/02: each even Wednesday 12:00–13:50 A215, H. Rudová

Prerequisites

For seminar group using logic programming expected knowledge in backgrounds of propositional and predicate logic, e.g. based on the course IB101.
There are no prerequisites concerning logic programming.

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 23 fields of study the course is directly associated with, display

Course objectives

Graduate will understand how to apply declarative approach for problem solving with the help of constraint programming.
Graduate will understand which algorithms are used for implementation of the constraint programming approach to be able to propose a proper declarative model and proper search procedures. To achieve that graduate will learn various constraint propagation algorithms and search methods.
Graduate will be able describe solution of the problem using constraints either with the help of optimization programming language or constraint logic programming (the choice is related with the choice of seminar group).

Syllabus

• Constraint satisfaction problem. Introduction to problem modelling.
• 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.
• Problem modelling and real-life applications. Programming with selected programming language (OPL or CLP).

Literature

• 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/CLP(FD) programs in ILOG/SICStus Prolog. Seminaries include homeworks which solutions together with solutions of examples solved during seminaries are available at the course web site.

Assessment methods

There is following expected evaluation given as a sum of points for homeworks and final written exam: A 100 and more, B 90-99, C 80-89, D 70-79, E 65-69.
It is possible to get up to 100 points for final written exam. The exam also includes following types of questions: overview of some part, comparisons of methods or definitions, algorithms, definitions, examples (about 33% of the points corresponds to evaluation of the constraint model for given problem(s)).
There are two homeworks during a 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.
Knowledge about constraint logic programming (CLP) is expected for the CLP seminar group only. Similarly knowledge about optimization programming language (OPL) is expected for the OPL seminar group only.
Taking of seminaries is obligatory. Absence at more than seminar requires successful completion of additional examples corresponding to the number of absent hours. High number of missed seminaries does not allow completion of the course.

Language of instruction

Czech

Follow-Up Courses

• PA167 Scheduling

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://is.muni.cz/el/1433/podzim2015/PA163/index.qwarp

PA163 Constraint programming

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. Pavel Troubil, Ph.D. (seminar tutor)

Guaranteed by

doc. RNDr. Eva Hladká, Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Supplier department: Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Thu 14:00–15:50 A318

• Timetable of Seminar Groups:

PA163/01: each even Friday 8:00–9:50 B117, H. Rudová
PA163/02: each odd Friday 8:00–9:50 B117, H. Rudová
PA163/03: each odd Wednesday 12:00–13:50 B117, P. Troubil

Prerequisites

For seminar group using logic programming expected knowledge in backgrounds of propositional and predicate logic, e.g. based on the course IB101.
There are no prerequisites concerning logic programming.

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 22 fields of study the course is directly associated with, display

Course objectives

Graduate will understand how to apply declarative approach for problem solving with the help of constraint programming.
Graduate will understand which algorithms are used for implementation of the constraint programming approach to be able to propose a proper declarative model and proper search procedures. To achieve that graduate will learn various constraint propagation algorithms and search methods.
Graduate will be able describe solution of the problem using constraints either with the help of constraint logic programming or optimization programming language (the choice is related with the choice of seminar group).

Syllabus

• Constraint satisfaction problem. Introduction to problem modelling.
• 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.
• Constraint logic programming, OPL (Optimization Programming Language).
• 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)/OPL programs in SICStus Prolog/ILOG. Seminaries include homeworks which solutions together with solutions of examples solved during seminaries are available at the course web site.

Assessment methods

Final written exam (about 7 examples, 100 points). There is following evaluation: A 90 and more, B 80-89, C 70-79, D 60-69, E 55-59. The exam also includes following types of questions: overview of some part, comparisons of methods or definitions, algorithms, definitions, examples (about 33% of the points corresponds to evaluation of the constraint model for given problem(s)).
Bonus examples are available on three random lectures, only students taking a part in the lecture can send their solution to the teacher. It is possible to get points up to 6 points per each example set. Each student is required to obtain 5 bonus points at least from the total point of 18 points. Bonus points can be added to the final exam points to improve evaluation.
Knowledge about constraint logic programming (CLP) is expected for the CLP seminar group only. Similarly knowledge about optimization programming language (OPL) is expected for the OPL seminar group only.
Taking of seminaries is obligatory. Absence at more than seminar requires successful completion of additional examples corresponding to the number of absent hours. High number of missed seminaries does not allow completion of the course.

Language of instruction

Czech

Follow-Up Courses

• PA167 Scheduling

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://is.muni.cz/el/1433/podzim2014/PA163/index.qwarp

PA163 Constraint programming

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. Pavel Troubil, Ph.D. (seminar tutor)

Guaranteed by

doc. RNDr. Vlastislav Dohnal, Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Supplier department: Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Wed 10:00–11:50 G101

• Timetable of Seminar Groups:

PA163/01: each even Thursday 14:00–15:50 B204, H. Rudová
PA163/02: each odd Thursday 14:00–15:50 B204, P. Troubil

Prerequisites

For computer laboratories: expected knowledge in backgrounds of propositional and predicate logic, e.g. based on the course IB101.
There are no prerequisites concerning logic programming.

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 22 fields of study the course is directly associated with, display

Course objectives

Graduate will understand how to apply declarative approach for problem solving with the help of constraint programming.
Graduate will understand which algorithms are used for implementation of the constraint programming approach to be able to propose a proper declarative model and proper search procedures. To achieve that graduate will learn various constraint propagation algorithms and search methods.
Graduate will be able describe solution of the problem using constraints either with the help of constraint logic programming or optimization programming language (the choice is related with the choice of seminar group).

Syllabus

• Constraint satisfaction problem. Introduction to problem modelling.
• 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.
• Constraint logic programming, OPL (Optimization Programming Language).
• 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)/OPL programs in SICStus Prolog/ILOG. 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). The exam also includes following types of questions: overview of some part, comparisons of methods or definitions, algorithms, definitions, examples (about 33% of the points corresponds to evaluation of the constraint model for given problem(s)). Taking of seminaries is obligatory. Absence at more than seminar requires successful completion of additional examples corresponding to the number of absent hours. High number of missed seminaries does not allow completion of the course.

Language of instruction

Czech

Follow-Up Courses

• PA167 Scheduling

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://is.muni.cz/el/1433/podzim2013/PA163/index.qwarp

PA163 Constraint programming

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)

Guaranteed by

prof. RNDr. Luděk Matyska, CSc.
Department of Computer Systems and Communications – Faculty of Informatics
Supplier department: Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Wed 12:00–13:50 G124

• Timetable of Seminar Groups:

PA163/01: each even Thursday 12:00–13:50 B117, H. Rudová
PA163/02: each odd Thursday 12:00–13:50 B117, H. Rudová

Prerequisites

For computer laboratories: expected knowledge in backgrounds of propositional and predicate logic, e.g. based on the course IB101.

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 22 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.
• 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.
• 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). The exam also includes following types of questions: overview of some part, comparisons of methods or definitions, algorithms, definitions, examples (about 33% of the points corresponds to evaluation of the constraint model for given problem(s)). Taking of seminaries is obligatory. Absence at more than seminar requires successful completion of additional examples corresponding to the number of absent hours. High number of missed seminaries does not allow completion of the course.

Language of instruction

Czech

Follow-Up Courses

• PA167 Scheduling

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://is.muni.cz/el/1433/podzim2012/PA163/index.qwarp

PA163 Constraint programming

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. Luděk Matyska, CSc.
Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Wed 12:00–13:50 B410 and each even Thursday 12:00–13:50 A104

Prerequisites

For computer laboratories: recommended knowledge in backgrounds of propositional and predicate logic, e.g. based on the course IB101 Introduction to logic and logic programming.

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 27 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.
• 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.
• 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). The exam also includes following types of questions: overview of some part, comparisons of methods or definitions, algorithms, definitions, examples (about 33% of the points corresponds to evaluation of the constraint model for given problem(s)). Taking of seminaries is obligatory. Absence at more than seminar requires successful completion of additional examples corresponding to the number of absent hours. High number of missed seminaries does not allow completion of the course.

Language of instruction

Czech

Follow-Up Courses

• PA167 Scheduling

Further Comments

Study Materials
The course is taught annually.

Teacher's information

https://is.muni.cz/auth/el/1433/podzim2011/PA163/index.qwarp

PA163 Constraint programming

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

Wed 12:00–13:50 B410

• Timetable of Seminar Groups:

PA163/01: each even Friday 8:00–9:50 A104, H. Rudová
PA163/02: each odd Friday 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). The exam also includes following types of questions: overview of some part, comparisons of methods or definitions, algorithms, definitions, examples (about 33% of the points corresponds to evaluation of the constraint model for given problem(s)). 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

• PA167 Scheduling

Further Comments

Study Materials
The course is taught annually.

Teacher's information

https://is.muni.cz/el/1433/podzim2010/PA163/index.qwarp

PA163 Constraint programming

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

• PA167 Scheduling

Further Comments

Study Materials
The course is taught annually.

Teacher's information

https://is.muni.cz/el/1433/podzim2009/PA163/index.qwarp

PA163 Constraint programming

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)

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 even Thursday 12:00–13:50 B116, H. Rudová
PA163/02: each odd Thursday 12:00–13: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 19 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.

Assessment methods

The course has a form of a lecture with a seminar taking two hours per two weeks at the computer laboratory. Examination consists of final written and oral exam. Written exam includes questions: overview of some part, comparisons of methods or definitions, algorithms, definitions, examples. Oral exam includes individual questions for each students together with the discussion over written exam. Resit dates are in the form of oral examination only.

Language of instruction

Czech

Follow-Up Courses

• PA167 Scheduling

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://is.muni.cz/elearning/warp.pl?fakulta=1433;obdobi=4384;kod=PA163;qurl=/el/1433/podzim2008/PA163/index.qwarp

PA163 Constraint programming

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)

Guaranteed by

prof. RNDr. Václav Matyáš, M.Sc., Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Thu 8:00–9:50 B204 and each odd Tuesday 10:00–11:50 X Datový projektor, each odd Tuesday 10:00–11:50 B116

• Timetable of Seminar Groups:

PA163/02: each even Tuesday 10:00–11:50 X Datový projektor, each even Tuesday 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 19 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 modelling are presented along with the application of constraints. Seminaries are devoted to the training of practical examples in constraint logic programming with computer.

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.

Assessment methods (in Czech)

Písemná práce pro každý řádný termín, představuje společnou přípravu pro všechny studenty, cca 5 otázek: přehledové, srovnávací, algoritmy, pojmy, příklady.
Ústní zkouška ve stejný den jako písemná práce, příprava na individuální otázky, během zkoušky diskuse nad písemnou prací.
Opravný termín pouze jako ústní zkouška.

Language of instruction

Czech

Follow-Up Courses

• PA167 Scheduling

Further comments (probably available only in Czech)

Study Materials
The course is taught annually.

Teacher's information

http://is.muni.cz/elearning/warp.pl?fakulta=1433;obdobi=3724;kod=PA163;qurl=/el/1433/podzim2007/PA163/index.qwarp

PA163 Constraint programming

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)

Guaranteed by

prof. RNDr. Václav Matyáš, M.Sc., Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Wed 10:00–11:50 B204 and each even Friday 9:00–10:50 X Datový projektor, each even Friday 9:00–10:50 B116

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 7 fields of study the course is directly associated with, display

Course objectives

The course studies the area of constraint satisfaction. Constraint propagation and search methods are represented by both classical and new algorithms. The basic techniques to the problem modelling are presented along with the application of constraints. Seminaries are devoted to the training of practical examples in constraint logic programming with computer.

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.

Assessment methods (in Czech)

Písemná práce pro každý řádný termín, představuje společnou přípravu pro všechny studenty, cca 5 otázek: přehledové, srovnávací, algoritmy, pojmy, příklady.
Ústní zkouška ve stejný den jako písemná práce, příprava na individuální otázky, během zkoušky diskuse nad písemnou prací.
Opravný termín pouze jako ústní zkouška.

Language of instruction

Czech

Further comments (probably available only in Czech)

Study Materials
The course is taught annually.

Teacher's information

http://www.fi.muni.cz/~hanka/cp

PA163 Constraint programming

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)

Guaranteed by

prof. RNDr. Václav Matyáš, M.Sc., Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Fri 8:00–9:50 X Datový projektor, Fri 8:00–9:50 B204 and each odd Friday 10:00–11:50 B116, each odd Friday 10:00–11:50 X Datový projektor

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 7 fields of study the course is directly associated with, display

Course objectives

The course studies the area of constraint satisfaction. Constraint propagation and search methods are represented by both classical and new algorithms. The basic techniques to the problem modelling are presented along with the application of constraints. Seminaries are devoted to the training of practical examples in constraint logic programming with computer.

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 and hybrid search.
• Optimization and over-constrained problems: frameworks and algorithms.
• 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.
• Barták, Roman. On-line guide to constraint programming. http://kti.ms.mff.cuni.cz/~bartak/constraints/index.html

Assessment methods (in Czech)

Písemná práce pro každý řádný termín, představuje společnou přípravu pro všechny studenty, cca 5 otázek: přehledové, srovnávací, algoritmy, pojmy, příklady.
Ústní zkouška ve stejný den jako písemná práce, příprava na individuální otázky, během zkoušky diskuse nad písemnou prací.
Opravný termín pouze jako ústní zkouška.

The written exam for each regular date. It is a preparation for all students, it includes about 5 questions: outline of certain part, comparison of some approaches, algorithms, terminology and its explanation, examples.
The oral exam in the same day as the written exam, preparation on individual questions, discussion about written exam.
Irregular dates as oral exam only.

Language of instruction

Czech

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://www.fi.muni.cz/~hanka/cp

PA163 Constraint programming

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)

Guaranteed by

prof. RNDr. Luděk Matyska, CSc.
Department of Machine Learning and Data Processing – Faculty of Informatics

Timetable

Fri 10:00–11:50 A107, Fri 12:00–12:50 B311

Course Enrolment Limitations

The course is only offered to the students of the study fields the course is directly associated with.

fields of study / plans the course is directly associated with

there are 7 fields of study the course is directly associated with, display

Course objectives

The course studies the area of constraint satisfaction. Constraint propagation and search methods are represented by both classical and new algorithms. The basic techniques to the problem modelling are presented along with the application of constraints in the areas as logic programming or object oriented programming. Solving of smaller examples and modelling of real-life problems is also shown. Seminaries are devoted to the training of practical examples in constraint programming with computer.

Syllabus

• Constraint satisfaction problem. Introduction to problem modelling. Constraint representation. Complexity.
• Algorithms and consistency: arc, path, k-consistency. Directional versions, width of constraint graph and polynomial problems. Global constraints and consistency algorithms.
• Tree search: backtracking, look ahead, look back, incomplete algorithms. Local and hybrid search.
• Optimization and over-constrained problems: frameworks and algorithms.
• Constraint logic and object-oriented constraint 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
• APT, Krzysztof R. Principles of constraint programming. Cambridge: Cambridge University Press, 2003, xii, 407. ISBN 0521825830. info
• MARRIOTT, Kim and P. J. STUCKEY. Programming with constraints : an introduction. Cambridge: MIT Press, 1998, xiv, 467. ISBN 0262133415. info
• VAN HENTENRYCK, Pascal. Constraint Satisfaction in Logic Programming. Cambridge: Massachusetts Institute of Technology, 1989, 224 s. ISBN 0262081814. info
• BARTÁK, Roman. On-line guide to constraint programming. 1998. http://kti.mff.cuni.cz/~bartak/constraints info

Assessment methods (in Czech)

Písemná práce pro každý řádný termín, představuje společnou přípravu pro všechny studenty, cca 5 otázek: přehledové, srovnávací, algoritmy, pojmy, příklady.
Ústní zkouška ve stejný den jako písemná práce, příprava na individuální otázky, během zkoušky diskuse nad písemnou prací.
Opravný termín pouze jako ústní zkouška.

The written exam for each regular date. It is a preparation for all students, it includes about 5 questions: outline of certain part, comparison of some approaches, algorithms, terminology and its explanation, examples.
The oral exam in the same day as the written exam, preparation on individual questions, discussion about written exam.
Irregular dates as oral exam only.

Language of instruction

Czech

Further Comments

The course is taught annually.

Teacher's information

http://www.fi.muni.cz/~hanka/cp

PA163 Constraint programming

Extent and Intensity

2/0. 2 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).

Teacher(s)

doc. Mgr. Hana Rudová, Ph.D. (lecturer)

Guaranteed by

prof. RNDr. Luděk Matyska, CSc.
Department of Machine Learning and Data Processing – Faculty of Informatics

Timetable

Thu 9:00–10:50 X Datový projektor, Thu 9:00–10:50 B007

Course Enrolment Limitations

The course is only offered to the students of the study fields the course is directly associated with.

fields of study / plans the course is directly associated with

• Applied Informatics (programme FI, N-AP)
• Informatics (programme FI, M-IN)
• Informatics (programme FI, N-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, N-SS)

Course objectives

The course studies the area of constraint satisfaction. Search and constraint propagation methods are represented by both classical and new algorithms. The basic techniques to the problem modelling are presented along with the application of constraints in the areas as logic programming or concurrent programming. Solving of smaller examples and modelling of real-life problems is also shown.

Syllabus

• Constraint satisfaction problem. Binary and non-binary constraints. Constraint reprezentation. Complexity.
• Algorithms and consistency: node, arc, path, k-consistency.
• Tree search algorithms: backtracking, limited discrepancy search, incomplete methods, intelligent backtracking.
• Search algorithms with constraint propagations.
• Local search algorithms.
• Hybrid search algorithms.
• Global constraints: problem modelling, solution methods.
• Optimization problems and algorithms.
• Over-constrained problems: frameworks and algorithms.
• Constraint logic programming. Concurrent constraint programming. Distributed constraint satisfaction. Constraint-based agents.
• Survey of software tools, constraint programming in practical examples.
• Problem modelling and real-life applications.

Literature

• Dechter, Rina. Constraint Processing. Morgan Kaufmann Publishers, 2003.
• Apt, Kryzstof R. Principles of Constraint Programming. Cambridge University Press, 2003.
• MARRIOTT, Kim and P. J. STUCKEY. Programming with constraints : an introduction. Cambridge: MIT Press, 1998, xiv, 467. ISBN 0262133415. info
• VAN HENTENRYCK, Pascal. Constraint Satisfaction in Logic Programming. Cambridge: Massachusetts Institute of Technology, 1989, 224 s. ISBN 0262081814. info
• BARTÁK, Roman. On-line Guide to Constraint Programming. 2002. URL info

Assessment methods (in Czech)

Kratší písemná práce pro každý řádný termín, představuje společnou přípravu pro všechny studenty, cca 5 otázek: přehledové, algoritmy, pojmy, příklady. Ústní zkouška ve stejný den jako písemná práce, příprava na individuální otázky, během zkoušky diskuse nad písemnou prací.
Opravný termín pouze jako ústní zkouška.

Language of instruction

Czech

Further comments (probably available only in Czech)

The course is taught annually.

Teacher's information

http://www.fi.muni.cz/~hanka/cp

• Enrolment Statistics (recent)