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
Journal ArticleDOI
Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency
TL;DR: This first part of a mini-series of two articles, a solid foundation for (generalised) clause-sets is built up, including the notion of autarky systems, the interplay between autarkies and resolution, and basic notions of (DP-)reductions.
Journal ArticleDOI
Tunable diode laser spectroscopy with optimum wavelength scanning
TL;DR: In this paper, an improved signal processing method is given, aiming at a sensitivity improvement of the tunable diode laser spectroscopy based gas concentration measurement, where the gas absorption spectrum is probed with an optimum wavelength scanning function which enables a more efficient curve fit than for traditional linear wavelength scanning.
Computational Decision Support: Regret-based Models for Optimization and Preference Elicitation
TL;DR: While computers have long been used for decision support, the new richness of data sources and complexity of decision spaces bring with them demands for more sophisticated forms of algorithmic optimization to help decision makers determine suitable courses of action.
Book ChapterDOI
Projection Pushing Revisited
TL;DR: The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries, and the standard approach to join-query optimization is cost based.
Proceedings Article
Guitar fingering for music performance
TL;DR: The implemented fingering model, which accounts for the bio-mechanical constraints of the performer’s hand, is interfaced with a physical model of the classical guitar, which exploits the fingering to compute some sound synthesis parameters.
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.