A CLP-CPG model refers to the development of a combined clinical practice guideline for a specific patient with the aid of
constraint logic programming (CLP) [14].
For readers familiar with
Constraint Logic Programming (CLP) programs, we can say that SCLP(S) programs (also written SCLP when the semiring is obvious or not important) are just CLP programs [Jaffar and Lassez 1987] where constraints are defined over a certain c-semiring S = <A, +, x, 0, 1>.
The
constraint logic programming systems {log} [Dovier and Rossi 1993]; ECLIPSE [Eclipse 1994]; Conjunto [Gervet 1994]; and CLPS [Legeard and Legros 1991] allow finite set domains and constraints on them.
The
Constraint Logic Programming (CLIP) scheme defines a class of languages, CLP(X), which are parametric in the constraint domain X.
Thus optimizing compilers for
constraint logic programming which rely on a repeated source-to-source transformation and reanalysis cycle should make use of incremental algorithms, such as those presented in this article.
In the next section we will generalize independence, search space preservation, and the parallel execution model to the
constraint logic programming context.
The
constraint logic programming group at the IBM Watson Research Center is also an important thread whose work and collaborations have influenced and contributed to the research at PARC, ICOT, SICS, and the Weizmann Institute.
Distributed
Constraint Logic Programming. Series in Computer Science, vol.
In some fields, like
constraint logic programming, European companies represent a large share of the market and research.
Dechter's book also contains a chapter by David Cohen and Peter Jeavons on tractability and one by Francesca Rossi on
constraint logic programming.
Furthermore, such models can be easily extended to
constraint logic programming (CLP), as shown by the implementations of Van Hentenryck [1989] and McAloon and Tretkoff [1989].