Basic computer programming concepts (arrays, enum, loops, data structures…), logic and set theory, mathematical notation, graph theory, algorithms and complexity theory.

The objectives of this course are as follows:

1.       Learning the basics about Constraint Satisfaction Problems (CSPs).

2.       Learning how to model a CSP with MiniZinc.

3.       Learning the basics about Constraint Propagation for solving a CSP.

4.       Learning how to solve a CSP using MiniZinc interface for CSP algorithms.

5.     Learning the basics about Constraint Satisfaction Optimization Problems (CSOPs) and how to solve them with MiniZinc.

The contents of the course will consist of theoretical and practical (programming) classes with the following syllabus:

1. Constraints Satisfaction Problems and Constraint Programming
2. MiniZinc: basic use
3. Constraint Problem Modelling: Variables, domains and constraints
4. CSP Graph and Representations
5. CSP Solving techniques: search & propagation
6. Consistency techniques
7. MiniZinc: advanced constraints
8. Symmetry Breaking

The course will be evaluated through a project that each student will decide by him/herself, consisting of solving a constraint satisfaction problem using MiniZinc. Students will develop the project during the course, and then make a presentation the last day of course explaining the problem and showing the results obtained. They must also submit the MiniZinc code developed to solve the problem, along with a brief report indicating the results obtained.