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
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, ...
Get Handbook of Constraint Programming now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
