Embedding Propagators in a Concurrent Constraint Language.
Tobias Müller, Jörg Würtz · 1999
Solving large and hard discrete combinatorial problems often requires the design of new constraints. Current constraint systems focus on either highlevel modeling or efficient implementation technology. While each approach lacks the advantages of the other one, this paper describes the combination of them in the high-level concurrent constraint language Oz. We describe an interface to Oz providing abstractions to program new efficient constraints, preserving the benefits of Oz for problem modeling. While