Constraint programming is currently applied with success to the domain, such as scheduling, planning, vehicle routing, configuration, networking, and bioinformatics. The purpose of this book is to capture the full area and depth of field of constraint programming and become encyclopedic in scope and coverage. Each chapter of this handbook is intended to become an independent survey of the topic, and written by one or more authors, who led researchers in the area. The intended audience of the handbook is researchers, graduate students, higher year students and practitioners who want to learn about the art state-of-the-in constraint programming. The researchers from other fields should find in this handbook an effective way to learn about programming constraints and may use some constraint programming concepts and techniques in their work, thus providing a means for fruitful cross-fertilization between different research areas. The book is organized in two parts. The first part covers the basic fundamentals of programming constraints, including the history, the idea of constraint propagation, basic search methods, global constraints, tractability and computational complexity, and important issues in the modeling problem as a problem constraint. The second part includes the language constraints and solver, several useful extensions basic framework (such as interval constraints, structured domain, and distributed CSP), and the successful application areas for constraint programming.