Syllabus

1. Combinatorial problems in discrete domains.
2. Problem Modelling.
   a. Finite vs. Boolean domains.
   b. Constraints and constraint networks.
   c. Declarative modelling languages.
3. Problem Solving.
   a. Constraint Propagation.
   b. Consistency and algorithms for its maintenance.
   c. Integration with Backtracking.
   d. Advanced techniques: Global Constraints
   e. Advanced techniques: Intelligent backtracking (in SAT).
   f. Heuristics.

4. Continuous Constraints Satisfaction Problems
   a. Introduction to Interval Constraints
   b. Continuous Constraint Reasoning 
   c. Solving Continuous Constrants
  5. Continuous Constraints and Interval analysis.
   a. Representation of continuous domains
   b. Interval arithmetic and Functions.
   c. Interval Newton Method.
6. Problem Solving in Continuous Domains
   a. Associating Narrowing Functions to Constraints.
   b. Constraint Propagation and Consistency Enforcement.
   c. Constraint Newton method
   d. Modelling techniques
   e. Languages, tools and Benchmarks.