<< Prev | - Up - | Next >> |

Concurrent constraint programming is a form of constraint programming. Constraint programming provides a method for solving combinatorial problems, which comes with a well-developed technology. Combinatorial problems are traditionally formulated as logical formulas that are called *constraints*. Solving combinatorial problems is inherently difficult because of the disjunctive character of combinatorics.

Concurrent constraint programming is a technology to solve combinatorial problems. In this section, we first scetch typical applications, the underlying methodology, and the tools available in practice.

<< Prev | - Up - | Next >> |

Denys Duchier, Claire Gardent and Joachim Niehren

Version 1.2.4 (20020829)