Constraint logic programming
Joxan Jaffar, J.-L. Lassez · ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL) · 1987
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.
Cited by 1,597 works. doi:10.1145/41625.41635
Authors
References
- The Definition and Implementation of a Computer Programming Language Based on Constraints
- Login: a logic programming language with built-in inheritance
- Logic Programming Language Scheme.
- Canonical logic programs
- Semantics of infinite tree logic programming
- Book reivew: LOGIC PROGRAMMING: FUNCTIONS, RELATIONS AND EQUATIONS. Edited by Doug DeGroot and Gary Lindstrom (Prentice-Hall)
- Some issues and trends in the semantics of logic programming
- PROLOG - II as an instance of the logic programming language scheme.
- Complex indeterminates in Prolog and its application to discourse models