Bounding search space size via (hyper)tree decompositions

Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, UAI 2008

Volumn , Issue , 2008, Pages 452-459

  Otten, Lars ^a   Dechter, Rina ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHICAL MODEL; HYPERTREE DECOMPOSITION; ORDERS OF MAGNITUDE; PRACTICAL PROBLEMS; PROBLEM SPECIFICATION; SEARCH ALGORITHMS; SEARCH SPACE SIZE; TREE DECOMPOSITION;

ARTIFICIAL INTELLIGENCE;

EID: 77953714783     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. R. Dechter and J. Pearl: Tree Clustering for Constraint Networks. Artificial Intelligence 38 (1989): 353-366.
2. R. Dechter and R. Mateescu: AND/OR search spaces for graphical models. In Artificial Intelligence 171 (2007): 73-106. (Pubitemid 46328845)
3. R. Dechter, L. Otten, and R. Marinescu: On the Practical Significance of Hypertree vs. Tree Width. In Proceedings of ECAI'08.
4. A. Dermaku, T. Ganzow, G. Gottlob, B.McMahan, N.Musliu, M. Samer: Heuristic Methods for Hypertree Decompositions. Technical Report DBAI-TR-2005-53, Vienna University of Technology, 2005
5. M. Fishelson, N. Dovgolevsky N, and D. Geiger: Maximum Likelihood Haplotyping for General Pedigrees. Human Heredity 59 (2005): 41-60. (Pubitemid 40663218)
6. G. Gottlob, N. Leone, and F. Scarcello: A comparison of structural CSP decomposition methods. Artificial Intelligence 124 (2000): 243-282. (Pubitemid 32029459)
7. D. S. Johnson: Approximation algorithms for combinatorial problems. In Proceedings of STOC'73: 38-49.
8. K. Kask, R. Dechter, J. Larrosa, and A. Dechter: Unifying tree decompositions for reasoning in graphical models. Artificial Intelligence 166 (2005): 165-193. (Pubitemid 40915125)
9. U. Kjærulff: Triangulation of Graphs - Algorithms Giving Small Total State Space. Research Report R-90-09, Dept. ofMathematics and Computer Science, Aalborg University 1990.
10. S. L. Lauritzen and D. J. Spiegelhalter: Local Computations with Probabilities on Graphical Structures and Their Application to Expert Systems. Journal of the Royal Statistical Society. Series B 50(2) (1988): 157-224.
11. R. Mateescu and R. Dechter: The Relationship Between AND/OR Search Spaces and Variable Elimination. In Proceedings of UAI'05: 380-387.
12. J. Pearl: Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, 1988.
13. M. Silberstein, A. Tzemach, N. Dovgolevskiy, M. Fishelson, A. Schuster, D. Geiger: Online system for faster linkage analysis via parallel execution on thousands of personal computers. American Journal of Human Genetics, 2006.
14. Y. Zabiyaka and A. Darwiche: Bounding Complexity in the Presence of Functional Dependencies. In Proceedings of SAT'06: 116-129.