## Handbook of Constraint ProgrammingConstraint programming is a powerful paradigm for solving combinatorial search problems that draws on a wide range of techniques from artificial intelligence, computer science, databases, programming languages, and operations research. Constraint programming is currently applied with success to many domains, such as scheduling, planning, vehicle routing, configuration, networks, and bioinformatics. The aim of this handbook is to capture the full breadth and depth of the constraint programming field and to be encyclopedic in its scope and coverage. While there are several excellent books on constraint programming, such books necessarily focus on the main notions and techniques and cannot cover also extensions, applications, and languages. The handbook gives a reasonably complete coverage of all these lines of work, based on constraint programming, so that a reader can have a rather precise idea of the whole field and its potential. Of course each line of work is dealt with in a survey-like style, where some details may be neglected in favor of coverage. However, the extensive bibliography of each chapter will help the interested readers to find suitable sources for the missing details. Each chapter of the handbook is intended to be a self-contained survey of a topic, and is written by one or more authors who are leading researchers in the area. The intended audience of the handbook is researchers, graduate students, higher-year undergraduates and practitioners who wish to learn about the state-of-the-art in constraint programming. No prior knowledge about the field is necessary to be able to read the chapters and gather useful knowledge. Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas. The handbook is organized in two parts. The first part covers the basic foundations of constraint programming, including the history, the notion of constraint propagation, basic search methods, global constraints, tractability and computational complexity, and important issues in modeling a problem as a constraint problem. The second part covers constraint languages and solver, several useful extensions to the basic framework (such as interval constraints, structured domains, and distributed CSPs), and successful application areas for constraint programming. - Covers the whole field of constraint programming - Survey-style chapters - Five chapters on applications |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

algebra applications approach arc consistency Artificial Intelligence assignment backjumping backtracking algorithm backtracking search Boolean cardinality Chapter combination combinatorial complexity component Computer Science Conference on Artificial configuration constraint language constraint logic programming constraint network constraint programming constraint propagation constraint satisfaction problems constraint solvers constraint-based cost Dechter defined Definition disjunction dynamic editor efficient example filtering finite domain Freuder function global constraints graph GSAT Hentenryck heuristic idempotent implementation implied constraints instance instantiation integer International Conference interval Lecture Notes linear lower bound LP relaxation methods minimal multiset node nogood Notes in Computer NP-complete NP-hard permutation polynomial Practice of Constraint Proceedings programming language random relation relaxation represent resource satisfies scheduling problems search algorithms search tree Section semantics soft constraints solving specific Springer straint strategy structure subproblem subset symmetry breaking tabu search techniques temporal Theorem tractable tuple vehicle routing vehicle routing problem