The CLP Procedure
-
Overview
-
Getting Started
-
Syntax
-
Details
-
ExamplesLogic-Based PuzzlesAlphabet Blocks ProblemWork-Shift Scheduling ProblemA Nonlinear Optimization ProblemCar Painting ProblemScene Allocation ProblemCar Sequencing ProblemRound-Robin ProblemResource-Constrained Scheduling with Nonstandard Temporal ConstraintsScheduling with Alternate Resources10×10 Job Shop Scheduling ProblemScheduling a Major Basketball ConferenceBalanced Incomplete Block DesignProgressive Party ProblemStatement and Option Cross-Reference Table
- References
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 CLP procedure 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.