Constraint Processing (Google eBook)
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
What people are saying - Write a review
We haven't found any reviews in the usual places.
acyclic algebra applied Artiﬁcial Intelligence assignment backjumping backtrack-free backtracking search binary constraints binary network Boolean bound bucket elimination Chapter clause cliques compute Conference on Artiﬁcial conﬂict set Consider constraint graph constraint language constraint network constraint problem constraint processing Constraint Programming constraint propagation constraint satisfaction problems cutset cycle-cutset Dechter deﬁned deﬁnition denoted dual graph efﬁcient elimination algorithm enforcing example exponential Figure ﬁnd ﬁnding ﬁnite domain ﬁrst forward-checking given globally consistent goal heuristic hypergraph inconsistent indicator problem induced graph induced width inference Input instantiation integers intervals join-tree linear logic programming look-ahead maximal mini-bucket minimal network nodes number of variables optimal ordered graph ordering d1 Output pair path-consistency primal graph procedure propositional random relational arc-consistency row convex satisﬁability scope search algorithm search space solved space complexity speciﬁc straint subproblem subset temporal THEOREM theory tractable languages tree decomposition tuple unit propagation variable elimination variable ordering yields