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
Book ChapterDOI
SAKey: Scalable Almost Key Discovery in RDF Data
TL;DR: SAKey is presented, an approach that discovers keys in RDF data in an efficient way that exploits characteristics of the data that are dynamically detected during the process and can discover keys in datasets where erroneous data or duplicates exist.
Journal ArticleDOI
Constraint programming systems for modeling music theories and composition
Torsten Anders,Eduardo Miranda +1 more
TL;DR: This survey compares generic music constraint programming systems according to a number of criteria such as the range of music theories these systems support, and introduces the field and its problems in general.
Book ChapterDOI
What Is Autonomous Search
TL;DR: A general definition and a taxonomy of search processes with respect to their computation characteristics are proposed and some computation rules between computation stages are used to formalize the solver modifications and adaptations.
Proceedings ArticleDOI
Multi-object Tracking via Constrained Sequential Labeling
TL;DR: This paper forms tracking as labeling mid-level features by object identifiers, and specifies a new approach, called constrained sequential labeling (CSL), for performing this labeling, which outperforms the state-of-the-art on challenging real-world videos of volleyball, basketball, and pedestrians walking.
Proceedings Article
Planning with goal utility dependencies
TL;DR: A novel heuristic framework that combines costpropagation and Integer Programming to select beneficial goals to find an informative heuristic estimate is introduced and the two implemented planners, iPUD and SPUDS, are compared empirically on several benchmark domains.
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.