Constraint ProcessingConstraint 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.

What people are saying  Write a review
We haven't found any reviews in the usual places.
Other editions  View all
Common terms and phrases
acyclic algebra applied arcconsistency Artiﬁcial Intelligence assignment backjumping backtrackfree backtracking search binary constraints binary network Boolean bound boundsconsistency bucket elimination Chapter chordal graphs clause cliques compute conﬂict set Consider constraint graph constraint language constraint network constraint problem constraint processing constraint propagation constraint satisfaction problems cutset cyclecutset Dechter deﬁned deﬁnition denoted dual graph efﬁcient elimination algorithm enforcing example exponential Figure ﬁnd ﬁnding ﬁnite domain ﬁrst forwardchecking given globally consistent goal heuristic hypergraph inconsistent indicator problem induced graph induced width inference Input instantiation integers intervals jointree linear logic programming lookahead maximal minibucket minimal network nogood nodes number of variables optimal ordered graph ordering d1 Output pair pathconsistency primal graph procedure propositional random relational arcconsistency row convex satisﬁes scope search algorithm search space solved space complexity speciﬁc straint subproblem subset temporal THEOREM tractable languages tree decomposition tuple unit propagation variable elimination variable ordering variable xi yields