%
% GENERATED FROM https://www.coli.uni-saarland.de
%    by   : anonymous
%    IP   : coli2006.lst.uni-saarland.de
%    at   : Mon, 05 Feb 2024 15:43:32 +0100 GMT
%    
% Selection : Reference #922
%




@InProceedings{Müller_Würtz:1997,
      AUTHOR = {Müller, Tobias and Würtz, Jörg},
      TITLE = {Extending a Concurrent Constraint Language by Propagators},
      YEAR = {1997},
      BOOKTITLE = {International Logic Programming Symposium (ILPS '97), October 12-17},
      PAGES = {149-163},
      EDITOR = {Maluszynski, J.},
      ADDRESS = {Port Jefferson, Long Island N.Y., USA},
      PUBLISHER = {MIT Press},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/mueller97.ps.gz},
      ABSTRACT = {This paper describes the extension of a concurrent constraint programming (CCP) language with an interface to define new finite domain constraints efficiently. While the extension is implemented for the CCP language Oz, the described interface is well-suited to be also applied to other CCP languages and even to Prolog-based implementations with coroutining. The interface is easily extendable to other constraint systems as done for set constraints. Constraints are implemented as instances of C++ classes, so-called propagators. Propagators are completely separated from the runtime system. The supplied abstractions are as high-level as to hide away issues like suspension handling but provide an expressiveness adequate to implement global constraints employing advanced algorithmic techniques. This allows to solve demanding combinatorial problems, as for instance scheduling problems. The presented interface exploits specific features of Oz, like equality constraints and local computation spaces, but avoids to bother the programmer with implementation details of these features.},
      ANNOTE = {COLIURL : Muller:1997:ECC.pdf Muller:1997:ECC.ps}
}