About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
COMPCON 1991
Conference paper
The CLP(R) language and system: An overview
Abstract
The basics of the CLP(R) language are reviewed, and some important programming techniques are described. A brief overview of the implementation of the CLP(R) interpreter is given. The operational model of the CLP(R) language is based on the amalgamation of two main procedures: a logic programming engine and a constraint solver for the domain of uninterpreted terms and arithmetic terms. In CLP(R) programs, constraints are used to specify the input parameter, appear dynamically during execution, and are output as answer constraints. Three clearly identifiable paradigms of CLP(R) programming methodology are described: hierarchical reasoning and constraint propagation, constraints as output, and a constrain-and-generate methodology for combinatorial search problems.