Basic Constraints vs. Propagators
Basic constraints
- are conjunctions of constraints of the form
- X = Y
- X ? S, where S is a finite set of integers
- enjoy complete constraint solving
Propagators
- can be arbitrarily expressive (arithmetic, symbolic)
- implementation typically fast but incomplete