CLP Procedure

Procedures in Online Documentation

The CLP procedure is a finite domain constraint programming solver for constraint satisfaction problems (CSPs) with linear, logical, global, and scheduling constraints. In addition to having an expressive syntax for representing CSPs, the solver features powerful built-in consistency routines and constraint propagation algorithms, a choice of nondeterministic search strategies, and controls for guiding the search mechanism that enable you to solve a diverse array of combinatorial problems.

The Constraint Satisfaction Problem

A CSP is defined by a finite set of variables taking values from finite domains and a finite set of constraints restricting the values the variables can simultaneously take.

A CSP can be defined as a triple CLP triple where

Input Data

Input information is contained in the following data sets:

Output Data

The output of the CLP procedure is captured in the following data sets:


CLP procedure examples