Chapter 7 Tractable structures for constraint satisfaction problems

Foundations of Artificial Intelligence

Volumn 2, Issue C, 2006, Pages 209-244

  Dechter, Rina ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77956764205     PISSN: 15746526     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1574-6526(06)80011-8     Document Type: Chapter

References (46)

1. Arnborg S.A. Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey. BIT 25 (1985) 2-23
2. Arnborg S.A., Corneil D.G., and Proskourowski A. Complexity of finding embeddings in a k-tree. SIAM Journal of Discrete Mathematics 8 (1987) 277-284
3. Bayardo R., and Miranker D. A complexity analysis of space-bound learning algorithms for the constraint satisfaction problem. AAAI'96: Proceedings of the Thirteenth National Conference on Artificial Intelligence (1996) 298-304
4. Becker A., and Geiger D. A sufficiently fast algorithm for finding close to optimal junction trees. Uncertainty in AI (UAI'96) (1996) 81-89
5. Becker A., Bar- Yehuda R., and Geiger D. Random algorithms for the loop-cutset problem. Uncertainty in AI (UAI'99) (1999) 81-89
6. Beeri C., Fagin R., Maier D., and Yannakakis M. On the desirability of acyclic database schemes. Journal of the ACM 30 3 (1983) 479-513
7. Bertele U., and Brioschi F. Nonserial Dynamic Programming (1972), Academic Press
8. Bidyuk B., and Dechter R. On finding w-cutset in Bayesian networks. Uncertainty in AI (UAI04) (2004)
9. Bodlaender H.L. Treewidth: Algorithmic techniques and results. MFCS-97 (1997) 19-36
10. Bodlaender H.L., Gilbert J.R., Hasfsteinsson H., and Kloks T. Approximating treewidth, pathwidth and minimum elimination tree-height. Technical report RUUCS-91-1, Utrecht University (1991)
11. Dechter R. And/or search spaces for graphical models. UCI Technical report (2005)
12. Dechter R. Constraint Processing (2003), Morgan Kaufmann Publishers
13. Dechter R. Constraint networks. Encyclopedia of Artificial Intelligence (1992) 276-285
14. Dechter R. Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition. Artificial Intelligence 41 (1990) 273-312
15. Dechter R. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence 113 (1999) 41-85
16. Dechter R., and Mateescu R. The impact of and/or search spaces on constraint satisfaction and counting. Proceeding of Constraint Programming (CP2004) (2004) 731-736
17. Dechter R., and Pearl J. Network-based heuristics for constraint satisfaction problems. Artificial Intelligence 34 (1987) 1-38
18. Dechter R., and Pearl J. Tree clustering for constraint networks. Artificial Intelligence (1989) 353-366
19. Even S. Graph algorithms. Computer Science Press (1979)
20. Fishelson M., and Geiger D. Exact genetic linkage computations for general pedigrees. Bioinformatics (2002)
21. Fishelson M., and Geiger D. Optimizing exact genetic linkage computations. RECOMB (2003) 114-121
22. Fishelson M., Dovgolevsky N., and Geiger D. Maximum likelihood haplotyping for general pedigrees. Human Heredity (2005)
23. Freuder E.C. A sufficient condition for backtrack-free search. Journal of the ACM 29 1 (1982) 24-32
24. Freuder E.C. A sufficient condition for backtrack-bounded search. Journal of the ACM 32 1 (1985) 755-761
25. Freuder E.C., and Quinn M.J. Taking advantage of stable sets of variables in constraint satisfaction problems. Joint International Conference of Artificial Intelligence (1985)
26. Freuder E.C., and Quinn M.J. The use of lineal spanning trees to represent constraint satisfaction problems. Technical Report 87-41 (1987), University of New Hampshire
27. Freuder E.C., and Wallace R.J. Partial constraint satisfaction. Artificial Intelligence 58 1-3 (1992) 21-70
28. Gaschnig J. Performance measurement and analysis of search algorithms. Technical Report CMU-CS-79-124 (1979), Carnegie Mellon University, Durham
29. Gottlob G., Leone N., and Scarcello F. A comparison of structural CSP decomposition methods. Artificial Intelligence (2000) 243-282
30. Gottlob G., Leone N., and Scarcello F. The complexity of acyclic conjunctive queries. Journal of the ACM (2001) 431-498
31. Greco G., and Scarcello F. Non-binary constraints and optimal dual-graph representations. Ijcai-03 (2003)
32. Gyssens M., Jeavons P., and Cohen D. Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence 66 (1994) 57-89
33. Kask K., Dechter R., Larrosa J., and Dechter A. Unifying tree-decompositions for reasoning in graphical models. Artificial Intelligence 166 1-2 (2005) 165-193
34. Larrosa J., and Dechter R. Dynamic combination of search and variable-elimination in CSP and Max-CSP. Submitted (2001)
35. Lauritzen S.L., and Spiegelhalter D.J. Local computation with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society, Series B 50 2 (1988) 157-224
36. Mackworth A.K. Consistency in networks of relations. Artificial Intelligence 8 1 (1977) 99-118
37. Mackworth A.K., and Freuder E.C. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence 25 (1985)
38. Maier D. The theory of relational databases. Computer Science Press, Rockville, MD (1983)
39. McMahan B. Bucket elimination and hypertree decompositions (2004), Institute of Information Systems (DBAI), TU
40. Rish I., and Dechter R. Resolution vs. search; two strategies for sat. Journal of Automated Reasoning 24 1/2 (2000) 225-275
41. Samer M. Hypertree decomposition via branch-decomposition. International Joint-conference of Artificial Intelligence (IJCAI05) (2005) 1535-1536
42. Scarcello F., Greco G., and Leone N. Weighted hypertree decompositions and optimal query plans. PODS'04 (2004) 210-221
43. Seidel R. A new method for solving constraint satisfaction problems. International Joint Conference on Artificial Intelligence (Ijcai-81) (1981) 338-342
44. Shenoy P.P. Binary join trees. Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence (UAI96) (1996) 492-499
45. Shoiket K., and Geiger D. A practical algorithm for finding optimal triangulations. Fourteenth National Conference on Artificial Intelligence (AAAI'97) (1997) 185-190
46. Tarjan R.E., and Yannakakis M. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs. SIAM Journal of Computation 13 3 (1984) 566-579