An abstract machine is described for the CLP(<inline-equation> <f><sc>R</sc></f> </inline-equation>) programming language. It is intended as a first step toward enabling CLP(<inline-equation>â€¦ (More)

Operational semantics provide a simple, high-level and elegant means of specifying interpreters for programming languages. In natural semantics, a form of operational semantics, programs areâ€¦ (More)

Implementation technology for higher-order logic programming languages such as Î»Prolog [17] and Elf [21] is still in its infancy. There are many features of these languages that do not occur inâ€¦ (More)

We describe a parallel resolution theorem prover, called Parthenon, that handles full first order logic. Although there has been much work on parallel implementations of logic programming languages,â€¦ (More)

Generation of eecient code for constraint logic programming (CLP) languages poses new problems. It is not yet clear which techniques from Prolog compilation will be important nor what sort of domainâ€¦ (More)

In constraint logic programming (CLP) systems, the standard technique for dealing with hard constraints is to delay solving them until additional constraints reduce them to a simpler form. Forâ€¦ (More)

A number of Constraint logic Programming systems, including CLP(R) and Prolog III, decide simultaneous linear inequalities as part of the fundamental operational step of constraint solving. Whileâ€¦ (More)

The Constraint Logic Programming (CLP) scheme, developed by Jaffar and Lassez, defines a class of ruleâ€“based constraint programming languages. These generalize traditional logic programming languagesâ€¦ (More)