5 Finite Domain Constraints: FD

The procedures in this module have the following properties.

Each of their applications creates a new thread except for basic constraints which may block.

Most of the propagators perform interval propagation. Only some do domain propagation (i. e. cut holes into domains).

Equality between variables is exploited, except for some non-linear propagators. For example, A+A=:B is equivalent to 2*A=:B (for notation see sec.infix-ps).

The constraint store is amplified with constraints X::Spec and equality between variables, e. g., X=:Y is equivalent to X=Y.

relation symbols

There are generic procedures who take an atomic argument A to denote an arithmetic relation . The possible atoms and the associated relations are summarized below.

• 5.1 Some Facts About Propagators

• 5.2 The Concept of Constructive Disjunction

• 5.3 Finite Domains

• 5.4 Telling Domains

• 5.5 Reflection

• 5.6 Watching Domains

• 5.7 Generic Propagators

• 5.8 Symbolic Propagators

• 5.9 0/1 Propagators

• 5.10 Reified Constraints

• 5.11 Miscellaneous Propagators

• 5.12 Distribution

• 5.13 Assigning Values