English

En gång per termin

The goal of this course is to have each student acquire the knowledge on a new programming paradigm based on constraints over finite domains and provide experience of how to use these methods for solving combinatorial problems.

Introduction to constraint programming.
Basic algorithms used in constraint programming systems
(constraint satisfaction and consistency, optimisation).
Finite domain constraints.
Modelling with finite domain constraints.
Searching methods and optimisation.
Selected advanced issues.

be able to use basic concepts of constraint programming
be able to explain principles of constraint programming and define constraints for simple problems.

be able to model and implement constraint programs for a combinatorial problem
be able to use appropriate heuristics to implement efficient search methods.

demonstrate the ability to critically evaluate and compare different methods to solve combinatorial problems with help of constraint programming

Föreläsningar

Laborationer

Skriftlig tentamen

Inlämningsuppgifter

To qualify for a passing mark, the students must have completed the laboratory work and the project. To qualify for a higher mark a written examination is required.

Underkänd, godkänd

EDAA01 Programming - Second Course or EDAA30 Programming in Java - Second Course

Kuchcinski, K.: Modeling and Optimisation of Embedded Systems with Constraint Programming: Principles and Practice..

Distributed by the department.

EDAN01F

 -03-22

Professor Thomas Johansson