The CLP(R) Language and System

Joxan Jaffar, Spiro Michaylov, Peter J. Stuckey, Roland H.C. Yap

    Research output: Contribution to journalArticleResearchpeer-review

    323 Citations (Scopus)


    The CLPR programming language is defined, its underlyingphilosophy and programming methodology are discussed, importantimplementation issues are explored in detail, and finally, a prototypeinterpreter is described. CLPR is designed to be an instance of the Constraint LogicProgramming Scheme, a family of rule-based constraint programminglanguages defined by Jaffar and Lassez. The domain of computation R of this particular instance is the algebraic structureconsisting of uninterpreted functors over real numbers. An importantproperty of CLP R is that the constraints are treated uniformly in thesense that they are used to specify the input parameters to a program,they are the only primitives used in the execution of a program, andthey are used to describe the output of a program. Implementation of a CLP language, and of CLPR in particular, raises new problems in the design of aconstraint-solver. For example, the constraint solver must be incremental in the sensethat solving additional constraints must not entail the resolving of oldconstraints. In our system, constraints are filtered through aninference engine, an engine/solver interface, an equation solver and aninequality solver. This sequence of modules reflects a classificationand prioritization of the classes of constraints. Modules solving higherpriority constraints are isolated from the complexities of modulessolving lower priority constraints. This multiple-phase solving ofconstraints, together with a set of associated algorithms, gives rise toa practical system.

    Original languageEnglish
    Pages (from-to)339-395
    Number of pages57
    JournalACM Transactions on Programming Languages and Systems
    Issue number3
    Publication statusPublished - 5 Jan 1992


    • constraints
    • logic programming

    Cite this