The CLP(R) presented here extends Prolog with constraint logic
programming over reals. This facility is available if the CLP(R) part
of GNU Prolog has been installed. The solver is an instance of the
Constraint Logic Programming scheme introduced by Jaffar and Michaylov
in 1987 [10]. Constraints over reals are solved using an
incremental version of the simplex solver
lp_solve.
The interface between Prolog and the simplex solver is made using
attributed variables, therefore the CLP(R) part of GNU Prolog can only
be installed if the attributes part is installed too.
Copyright (C) 1999-2002 Daniel Diaz.
Chapters 9 and 10 : Copyright (C) 2002-2003 INRIA, Rémy Haemmerlé.
Verbatim copying and distribution of this entire article is permitted in any
medium, provided this notice is preserved.
More about the copyright