Projecting CLP R constraints

Joxan Jaffar, Michael J. Maher, Peter J. Stuckey, Roland H C Yap

    Research output: Contribution to journalArticleResearchpeer-review

    12 Citations (Scopus)

    Abstract

    The presentation of constraints in a usable form is an essential aspect of Constraint Logic Programming (CLP) systems. It is needed both in the output of constraints, as well as in the production of an internal representation of constraints for meta-level manipulation. Typically, only a small subset {Mathematical expression} of the variables in constraints is of interest, and so an informal statement of the problem at hand is: given a conjunction {Mathematical expression} of constraints, express the projection {Mathematical expression} of c onto {Mathematical expression} in the simplest form. In this paper, we consider the constraints of the CLP(R) system and describe the essential features of its projection module. One main part focuses on the well-known problem of projection in linear arithmetic constraints. We start with a classical algorithm and augment it with a procedure for eliminating redundant constraints generated by the algorithm. A second part discusses projection of the other object-level constraints: equations over trees and nonlinear equations. The final part deals with producing a manipulable form of the constraints, which complicates the projection problem.

    Original languageEnglish
    Pages (from-to)449-469
    Number of pages21
    JournalNew Generation Computing
    Volume11
    Issue number3-4
    DOIs
    Publication statusPublished - 1 Sep 1993

    Keywords

    • Constraint Logic Programming
    • Linear Arithmetic
    • Projection

    Cite this