## Foundations of Constraint Satisfaction |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### 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 c-node Chapter cluster compatibility checks complete graph compound label Conference on Artificial connectionist consistency constraint graph constraint satisfaction problems CSOP CSP solving Dechter Definition delete domain example Freuder GENET graph((V heuristic hill-climbing hyperedges hypergraph induced-width input invasion algorithm it-tree less L2 logic programming loop maximum cliques minimal bandwidth MUPs N-queens problem nodes of order number of nodes number of variables optimal path-consistency PCSP pick pound labels primal graph problem reduction procedure propagation 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 violated width xh x2