The DOI matches its Crossref record.
Constraint logic programming
Abstract
We address the problem of designing programming systems to reason with and about constraints. Taking a logic programming approach, we define a class of programming languages, the CLP languages, all of which share the same essential semantic properties. From a conceptual point of view, CLP programs are highly declarative and are soundly based within a unified framework of formal semantics. This framework not only subsumes that of logic programming, but satisfies the core properties of logic programs more naturally. From a user's point of view, CLP programs have great expressive power due to the constraints which they naturally manipulate. Intuition in the reasoning about programs is enhanced as a result of working directly in the intended domain of discourse. This contrasts with working in the Herbrand Universe wherein every semantic object has to be explicitly coded into a Herbrand term; this enforces reasoning at a primitive level. Finally, from an implementor's point of view, CLP systems can be efficient because of the exploitation of constraint solving techniques over specific domains.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Richardson, M., & Domingos, P. (2006) · Machine Learning · doi:10.1007/s10994-006-5833-1 · Cited by 2,676
Constraint logic programming: a survey
Jaffar, J., & Maher, M. J. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90033-7 · Cited by 1,312
Self-citationModels and languages for parallel computation
Skillicorn, D. B., & Talia, D. (1998) · ACM Computing Surveys · doi:10.1145/280277.280278 · Cited by 357
Rewriting Logic as a Logical and Semantic Framework
Martí-Oliet, N., & Meseguer, J. (2002) · Handbook of Philosophical Logic · doi:10.1007/978-94-017-0464-9_1 · Cited by 253
Logic-based technologies for multi-agent systems: a systematic literature review
Calegari, R., Ciatto, G., Mascardi, V., & Omicini, A. (2021) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-020-09478-3 · Cited by 117
Metadata
- Authors
- Jaffar, J., & Lassez, J.-L.
- Venue
- Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '87
- Publisher
- ACM Press
- Published
- 1987
- Pages
- 111-119
- OpenAlex
- W2123396057
- Cited by
- 1,597
- References
- 0
- FWCI
- 29.31
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Constraint logic programming. https://app.cochat.ai/papers/10.1145/41625.41635
- The paper
- Jaffar, J., & Lassez, J.-L. (1987). Constraint logic programming. Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '87. https://doi.org/10.1145/41625.41635
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
