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




@Article{Müller_Würtz:1999,
      AUTHOR = {Müller, Tobias and Würtz, Jörg},
      TITLE = {Embedding Propagators in a Concurrent Constraint Language},
      YEAR = {1999},
      JOURNAL = {The Journal of Functional and Logic Programming},
      NUMBER = {Special Issue 1},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/MuellerWuertz:99a.ps.gz},
      ABSTRACT = {Solving large and hard discrete combinatorial problems often requires the design of new constraints. Current constraint systems focus on either high-level 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 in CPP, preserving the benefits of Oz for problem modeling. While constraints and the Oz runtime system are linked through the interface, and adequate interface abstractions are supplied to implement advanced algorithmic techniques. In particular, it provides the means to reflect the validity of a constraint and to control and inspect the state of a constraint. This allows the user to solve demanding combinatorial problems, such as hard scheduling problems. It is desirable to execute concurrent constraint programs in parallel to profit from multiprocessor architectures. We discuss how the proposed interface can be adapted to parallel execution, avoiding the recoding of constraint implementations for sequential solvers.},
      NOTE = {Published on the Internet: http://mitpress.mit.edu/JFLP/, ISSN 1080--5230, MIT Press Journals, Five Cambridge Center, Cambridge, USA},
      ANNOTE = {COLIURL : Muller:1999:EPC.pdf Muller:1999:EPC.ps}
}