The CLP( ℛ ) language and system
Authors:
- Joxan JaffarJJJoxan Jaffar
- Spiro MichaylovSMSpiro Michaylov
- Peter J. StuckeyPSPeter J. Stuckey
- Roland H. C. YapRYRoland H. C. Yap
Open Access
- 1 May 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 14 (3) , 339-395
Abstract
The CLP( ℛ ) programming language is defined, its underlying philosophy and programming methodology are discussed, important implementation issues are explored in detail, and finally, a prototype interpreter is described. CLP( ℛ ) is designed to be an instance of the Constraint Logic Programming Scheme, a family of rule-based constraint programming languages defined by Jaffar and Lassez. The domain of computation ℛ of this particular instance is the algebraic structure consisting of uninterpreted functors over real numbers. An important property of CLP( ℛ )is that the constraints are treated uniformly in the sense that they are used to specify the input parameters to a program, they are the only primitives used in the execution of a program, and they are used to describe the output of a program. Implementation of a CLP language, and of CLP( ℛ ) in particular, raises new problems in the design of a constraint-solver. For example, the constraint solver must be incremental in the sense that solving additional constraints must not entail the resolving of old constraints. In our system, constraints are filtered through an inference engine, an engine/solver interface, an equation solver and an inequality solver. This sequence of modules reflects a classification and prioritization of the classes of constraints. Modules solving higher priority constraints are isolated from the complexities of modules solving lower priority constraints. This multiple-phase solving of constraints, together with a set of associated algorithms, gives rise to a practical system.Keywords
This publication has 12 references indexed in Scilit:
- An introduction to Prolog IIICommunications of the ACM, 1990
- Mockingbird: A logical methodology for testingThe Journal of Logic Programming, 1990
- CAL: A theoretical background of constraint logic programming and its applicationsJournal of Symbolic Computation, 1989
- Constraint Logic Programming and Option TradingIEEE Expert, 1987
- Constraint and declarative languages for engineering applications: The TK!Solver contributionProceedings of the IEEE, 1985
- The Programming Language Aspects of ThingLab, a Constraint-Oriented Simulation LaboratoryACM Transactions on Programming Languages and Systems, 1981
- Propagation of constraints applied to circuit synthesisInternational Journal of Circuit Theory and Applications, 1980
- Constraints1979
- New Finite Pivoting Rules for the Simplex MethodMathematics of Operations Research, 1977
- On fourier’s analysis of linear inequality systems1974