The Constraint Logic Programming (CLP) Scheme gave a formal framework, based on constraints, for the basic operational, logical and algebraic semantics of an extended class of logic programs.Expand

The notion of Cartesian closure on a set of unifiers has been used to define approximations of the least models of logic programs that are not only recursive, but can also be finitely represented in the form of a cyclic term graph.Expand

The CLP<inline-equation><f><fen lp="par"><rm><sc>R</sc></rm><rp post="par"></fen></f></inline-Equation> programming language is defined, its underlyingphilosophy and programming methodology are discussed, importantimplementation issues are explored in detail, and finally, a prototypeinterpreter is described.Expand

We give an algorithm for incremental satisfiability of unit TVPI constraints, and it can be augmented with a bounds-propagation technique for constraints more general than TVPI.Expand