Welcome,
New User!
New User!
Handbook of Constraint Programming
Imprint: Elsevier Science
Format: Adobe Encrypted (DRM)
Earn $0.50 - Write a Review »
Our Price
$152.82
Reward Money:
$0.00
Constraint 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
See more like this in our Computers eBooks section
Share your thoughts on the Handbook of Constraint Programming Computers eBook with others!
| Title of Computers eBook: Handbook of Constraint Programming | |
| Release Date: 10-13-2006 | |
| Publisher: Elsevier Science |
This eBook download is available in the following formats:
| Parent title | Handbook of Constraint Programming |
|---|---|
| Encrypted (DRM) | Yes |
| SKU | 9780080463803 |
| File size | 7681 |
| Security | n/a |
| Printing | Not allowed |
| Copying | Not allowed |
| Read aloud | No Sys requirements Download reader |
| Devices | Samsung Tablet, Apple Ipad & Iphone, Barnes & Noble Nook, Kobo eReader, Aluratek Libre, Iliad, Nokia, Blackberry, Hanlin |
| Note | Excellent navigation features are available via Adobe such as bookmarks and a quick access table of contents. Text search is easily accessible. An Adobe DRM-protected file is different than a pdf file in that it uses Adobe DRM (Digital Rights Management) technology, which authors and publishers use to protect their content from illegal online distribution and to set certain privileges such as restrictions on copying and printing. |
Handbook of Constraint Programming
Chapter One
IntroductionFrancesca Rossi, Peter van Beek, Toby Walsh
Constraint 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 basic idea in constraint programming is that the user states the constraints and a general purpose constraint solver is used to solve them. Constraints are just relations, and a constraint satisfaction problem (CSP) states which relations should hold among the given decision variables. For example, in scheduling activities in a company, the decision variables might be the starting times and the durations of the activities and the resources needed to perform them, and the constraints might be on the availability of the resources and on their use for a limited number of activities at a time.
Constraint solvers take a real-world problem like this, represented in terms of decision variables and constraints, and find an assignment to all the variables that satisfies the constraints. Constraint solvers search the solution space either systematically, as with backtracking or branch and bound algorithms, or use forms of local search which may be incomplete. Systematic method often interleave search and inference, where inference consists of propagating the information contained in one constraint to the neighboring constraints. Such inference (usually called constraint propagat
...Read full excerpt from Handbook of Constraint Programming ebook
