Open AccessBook
Constraint Processing
Reads0
Chats0
TLDR
Rina Dechter synthesizes three decades of researchers work on constraint processing in AI, databases and programming languages, operations research, management science, and applied mathematics to provide the first comprehensive examination of the theory that underlies constraint processing algorithms.Abstract:
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.
·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
Table of Contents
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; Bibliographyread more
Citations
More filters
Posted Content
Relation Variables in Qualitative Spatial Reasoning
TL;DR: In this paper, a relation between objects is a constraint whereas in the alternative approach it is a variable, and the relation-variable approach greatly simplifies integration and implementation of QSR.
Book ChapterDOI
DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees
TL;DR: In this article, the authors propose a unifying dynamic-programming framework to compute exact literal-weighted model counts of formulas in conjunctive normal form using project-join trees.
Book ChapterDOI
A high level language for solver independent model manipulation and generation of hybrid solvers
Daniel Fontaine,Laurent Michel +1 more
TL;DR: A high level language that allows for the specification and manipulation of solver independent models and allows for easily generating complex solvers in the Comet language and a more general framework based on abstract models and model operators is introduced.
Book ChapterDOI
Constraint Optimization Techniques for Exact Multi-Objective Optimization
Rollon Emma,Larrosa Javier +1 more
TL;DR: This work embeds Mini-Bucket Elimination in a multi-objective branch and bound search, and empirically demonstrates the performance of the new approach in two different domains.
Proceedings ArticleDOI
On the application of planning and scheduling techniques to e-learning
Antonio Garrido,Eva Onaindia +1 more
TL;DR: This paper presents an integrated planning and scheduling approach that accommodates the temporal and resource constraints of the environment to make a course applicable in a real scenario.
References
More filters
Journal ArticleDOI
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Book
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
TL;DR: Probabilistic Reasoning in Intelligent Systems as mentioned in this paper is a complete and accessible account of the theoretical foundations and computational methods that underlie plausible reasoning under uncertainty, and provides a coherent explication of probability as a language for reasoning with partial belief.