Foundations of Constraint SatisfactionAlmost everybody who works in artificial intelligence should know something about the Constraint Satisfaction Problem (CSP). CSPs appear in many areas, instance, vision, resource allocationin schedulign and temporal reasoning. This CSP is worth studying in isolation because it is a general problem that has unique features which can be exploited to arrive at solutions. The main objective of the book is to identify these properties and explain techniques for tackling CSPs. |
Contents
CSP solving An overview | 31 |
Fundamental concepts in the CSP | 53 |
Problem reduction | 79 |
Copyright | |
8 other sections not shown
Other editions - View all
Foundations of Constraint Satisfaction: Computation in Cognitive Science Edward Tsang Limited preview - 2014 |
Common terms and phrases
2-compound achieving acyclic adjacent applications arc-consistency Artificial Intelligence assigned backtracking bandwidth BEGIN binary constraint binary CSP bound branch and bound Chapter chordal graph cluster compatibility checks complete graph compound label Conference on Artificial connectionist constraint graph constraint satisfaction problems CSOP CSP solving Dechter Definition deleted domain example Fill_in-1 Freuder GENET heuristic hill-climbing hyperedges hypergraph input invasion algorithm k-tree logic programming lookahead algorithms loop maximum cliques member(X minimal bandwidth MUPS N-queens problem nodes of order number of nodes number of variables optimal path path-consistency PCSP pick pound labels primal graph problem reduction procedure propagation prune Queen range(N reduced redundant compound labels redundant constraints redundant values removing redundant represents Result rithms satisfies search space set of variables setup_candidate_lists(N shown in Figure solution synthesis solution tuples space complexity straints subset techniques Theorem tion unlabelled variables updated v-node violated width