Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

Constraints are everywhere: most computational problems can be described in terms of
restrictions imposed on the set of possible solutions, and constraint programming is a …

Constraint Programming (CP) is a healthy research area in the academic community. The
growing number of participants to the CP conference series, as well as the number of …

The use of constraints had its scientific and commercial breakthrough in the 1990s.
Programming with constraints makes it possible to model and specify problems with …

A constraint can be thought of intuitively as a restriction on a space of possibilities.
Mathematical constraints are precisely specifiable relations among several unknowns (or …

A major challenge in constraint programming is to develop efficient generic approaches to
solve instances of the constraint satisfaction problem (CSP). With this aim in mind, this book …

Welcome to the On-Line Guide to CONSTRAINT PROGRAMMING designed and maintained
by Roman Barták. I have opened this site as an on-line tutorial or, if you want, a textbook for …

Constraint propagation is widely recognized as a fundamental reasoning component in
constraint programming. In the last decade, the concept of “global constraint” has attracted …

This book provides a comprehensive and much needed introduction to the field by one of its
foremost experts. It is beautifully written and presents a unifying framework capturing a wide …

Constraint satisfaction algorithms are often benchmarked on hard, random problems. There
are, however, many reasons for wanting a larger class of problems in our benchmark suites …