Extending a Concurrent Constraint Language by Propagators
Tobias Müller, Jörg Würtz · The MIT Press eBooks · 1997
To solve large and hard discrete combinatorial problems it is often necessary to design new constraints. Current systems either focus on the high-level modeling aspect or on very efficient implementation technology. While each approach lacks the advantages of the other one, this paper describes the combination of both approaches in the concurrent constraint language Oz. Through an interface to program new finite domain constraints efficiently in C , the benefits of a high-level language to model a problem and of an efficient implementation technology for user-defined constraints are inherited. Constraints and