Constraint Processing,
Edition 1Editors: By Rina Dechter
Publication Date:
05 May 2003
Ways Of Reading
-
This e-publication is accessible to the full extent that the file format and types of content allow, on a specific reading device, by default, without necessarily including any additions such as textual descriptions of images or enhanced navigation.
Navigation
-
The contents of the PDF have been tagged to permit access by assistive technologies as per PDF-UA-1 standard.
-
Page breaks included from the original print source
Additional Accessibility Information
-
All (or substantially all) textual matter is arranged in a single logical reading order (including text that is visually presented as separate from the main text flow, e.g., in boxouts, captions, tables, footnotes, endnotes, citations, etc.). Non-textual content is also linked from within this logical reading order. (Purely decorative non-text content can be ignored).
-
The language of the text has been specified (e.g., via the HTML or XML lang attribute) to optimise text-to-speech (and other alternative renderings), both at the whole document level and, where appropriate, for individual words, phrases or passages in a different language.
Conformance
-
The publication was certified on 20250625
-
Accessibility addendum
-
For detailed accessibility information, see Elsevier’s website at https://www.elsevier.com/about/accessibility
-
For queries regarding accessibility information, contact [email protected]
Note
-
This product relies on 3rd party tooling which may impact the accessibility features visible in inspection copies. All accessibility features mentioned would be present in the purchased version of the title.
Description
Constraint satisfaction is a simple but powerful tool. Constraints identify the impossible and reduce the realm of possibilities to effectively focus on the possible, allowing for a natural declarative formulation of what must be satisfied, without expressing how. The field of constraint reasoning has matured over the last three decades with contributions from a diverse community of researchers in artificial intelligence, databases and programming languages, operations research, management science, and applied mathematics. Today, constraint problems are used to model cognitive tasks in vision, language comprehension, default reasoning, diagnosis, scheduling, temporal and spatial reasoning.In Constraint Processing, Rina Dechter, synthesizes these contributions, along with her own significant work, to provide the first comprehensive examination of the theory that underlies constraint processing algorithms. Throughout, she focuses on fundamental tools and principles, emphasizing the representation and analysis of algorithms.
Key Features
- Examines the basic practical aspects of each topic and then tackles more advanced issues, including current research challenges
- Builds the reader's understanding with definitions, examples, theory, algorithms and complexity analysis
- Synthesizes three decades of researchers work on constraint processing in AI, databases and programming languages, operations research, management science, and applied mathematics
About the author
By Rina Dechter, University of California, Irvine
Preface; Introduction; Constraint Networks; Consistency-Enforcing Algorithms: Constraint Propagation; Directional Consistency; General Search Strategies; General Search Strategies: Look-Back; Local Search Algorithms; Advanced Consistency Methods; Tree-Decomposition Methods; Hybrid of Search and Inference: Time-Space Trade-offs; Tractable Constraint Languages; Temporal Constraint Networks; Constraint Optimization; Probabilistic Networks; Constraint Logic Programming; Bibliography
Title Reviews
“To summarize, this book distills well over three decades worth of development in CSP and constraint processing in a single textbook. I wholeheartedly recommend it to students, researchers and practitioners in artificial intelligence, constraint programming and operations research who want to know more about the theory of constraint processing."—Roland H.C. Yap, National University of Singapore, in Theory and Practice of Logic Programming“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 range of techniques for processing symbolic, numerical, and probabilistic information.¿ —Bart Selman, Cornell University“I’ve been waiting a long time for a good theoretical introduction to constraint programming. Rina Dechter’s book is just this. If you want to understand why this technology works, and how to make it work for you, then I recommend you read this book.¿ —Toby Walsh, Cork Constraint Computation Centre“The book is rigorous but it is not difficult to read. An abundance of examples illustrate concepts and algorithms. The reader is well guided through technical issues, so intuition is never hidden by technicalities.¿ —Pedro Meseguer, Institut d’Investigació en Intellingència Artificial – Consejo Superior de Investigaciones Científicas (IIIA-CSIC)“An indispensable resource for researchers and practitioners in AI and optimization.¿ —Henry Kautz, University of Washington“a welcome introduction to the field of constraint satisfaction that will help researchers, educators, and students understand what constraint processing is about. It is a comprehensive book that can be used as a companion for courses on constraint satisfaction especially because the reader does not need to be an expert in the area to understand the text. The introductory character of the book makes it easy to read; nevertheless advanced students and researchers may also find deeper information on some topics there. Rina Dechter is an excellent researcher with contributions in many areas of constraint satisfaction … I strongly recommend reading this book to everyone who wants to know what is behind constraint satisfaction technology and I think that this book should definitely be in the bookshelf of everyone who teaches constraint satisfaction.¿ —Roman Barták, Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic
ISBN:
9781558608900
Page Count:
512
Retail Price (USD)
:
Pearl: Probabilistic Reasoning in Intelligent Systems, Morgan Kaufmann (1991, 1558604790)
Access to teacher/student resources is available to registered users with approved review copies or confirmed adoptions. To review this material, please request a review copy.
graduate students and senior undergraduate students in artificial intelligence and operations research; researchers and practitioners in artificial intelligence and operations research