O'Reilly logo

Handbook of Constraint Programming by Toby Walsh, Peter van Beek, Francesca Rossi

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Foundations of Artificial Intelligence, Vol. 2, Suppl. (C), 2006

ISSN: 1574-6526

doi: 10.1016/S1574-6526(06)80011-8

Chapter 7 Tractable Structures for Constraint Satisfaction Problems

Rina Dechter

Throughout the past few decades two primary constraint processing schemes emerge— those based on conditioning or search, and those based on inference or derivation. Search in constraint satisfaction takes the form of depth-first backtracking, while inference is performed by variable-elimination and tree-clustering algorithms, or by bounded local consistency enforcing. Compared to human problem solving techniques, conditioning is analogous to guessing (a value of a variable), or reasoning by assumption. The problem is then divided into subproblems, ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required