Syllabus

1. Decision 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: Intelligent backtracking (in SAT).
   e. Heuristics.
4. Introduction to Continuous Constraints Satisfaction Problems.
5. Interval analysis.
   a. Interval arithmetic.
   b. Interval Newton method.
6. Constraint Propagation in Continuous Domains.
   a. Narrowing functions.
   b. Propagation algorithms.
   c. Consistency.
7. Problem Solving in Continuous Domains.
   a. Modelling techniques.
   b. Languages and tools.
   c. Examples.