See also

This manual refers to Codac v1, but a new v2 implementation is currently in progress… an update of this manual will be available soon. See more.

Domains: sets of feasible values

Constraint Programming consists in reducing sets of feasible solutions to are not compliant with constraints defining a problem. The constraints are dealt with by operators called contractors, presented in the next part of this manual. The sets are called domains, introduced now.

For now, we consider two kinds of domains corresponding to:

• static variables that do not evolve with time: reals, vectors, matrices;

• dynamic variables depicting a temporal evolution: trajectories.

The related intervals, boxes and tubes are presented in the following pages:

• Intervals and boxes
  • Intervals, boxes and interval matrices
  • The empty set
  • Set operations
  • Interval arithmetic
• Tubes: sets of trajectories
  • Definition
  • Slices
  • Creating tubes
  • The vector case
  • Evaluations
  • Operations on sets
  • Integral computations
  • Updating values
  • Sampling and t-domain

See also: codac-unsupported.