Constraint logic programming languages
- 1 July 1990
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 33 (7), 52-68
- https://doi.org/10.1145/79204.79209
Abstract
Constraint Logic Programming (CLP) is an extension of Logic Programming aimed at replacing the pattern matching mechanism of unification, as used in Prolog, by a more general operation called constraint satisfaction. This aritcle provides a panoramic view of the recent work done in designing and implementing CLP languages. It also presents a summary of their theoretical foundations, discusses implementation issues, compares the major CLP languages, and suggests directions for further work.Keywords
This publication has 9 references indexed in Scilit:
- An introduction to Prolog IIICommunications of the ACM, 1990
- An incremental constraint solverCommunications of the ACM, 1990
- Solving systems of polynomial inequalities in subexponential timeJournal of Symbolic Computation, 1988
- A bibliography of quantifier elimination for real closed fieldsJournal of Symbolic Computation, 1988
- A view of the origins and development of PrologCommunications of the ACM, 1988
- Embedding boolean expressions into logic programmingJournal of Symbolic Computation, 1987
- Constraint logic programmingPublished by Association for Computing Machinery (ACM) ,1987
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpointsPublished by Association for Computing Machinery (ACM) ,1977
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976