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.},
apice = {ClpPopl87},
author = {Joxan Jaffar and Jean-Louis Lassez},
booktitle = {POPL '87: Proceedings of the 14th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages},
doi = {10.1145/41625.41635},
isbn10 = {0-89791-215-2},
location = {New York, NY, USA},
numpages = 9,
pages = {111--119},
publisher = {ACM},
title = {Constraint Logic Programming},
year = 1987
}