Using recursive decomposition to construct elimination orders, jointrees, and dtrees

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2143, Issue , 2001, Pages 180-191

  Darwiche, Adnan ^a   Hopkins, Mark ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS;

DIRECT METHOD; DIRECTED ACYCLIC GRAPH (DAG); GRAPHICAL MODEL; HYPERGRAPH PARTITIONING; RECURSIVE DECOMPOSITION;

ALGORITHMS;

EID: 84937409052     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44652-4_17     Document Type: Conference Paper

References (15)

1. Charles J. Alpert and Andrew B. Kahng. Recent directions in netlist partitioning. Integration, the VLSI Journal, 19(1-81), 1995.
2. F. Beglez and H. Fujiwara. A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN. In Proceedings of the IEEE symposium on Circuits and Systems, 1985. http://www.cbl.ncsu.edu/www/CBLDocs/iscas85.html.
3. Adnan Darwiche. Compiling knowledge into decomposable negation normal form. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pages 284-289, 1999.
4. Adnan Darwiche. Utilizing device behavior in structure-based diagnosis. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pages 1096-1101, 1999.
5. Adnan Darwiche. Recursive conditioning. Artificial Intelligence, 126(1-2):5-41, February, 2001.
6. Adnan Darwiche and Mark Hopkins. Using recursive decomposition to construct elimination orders, jointrees and dtrees. Technical Report D-122, Computer Science Department, UCLA, Los Angeles, Ca 90095, 2001.
7. Rina Dechter. Bucket elimination: A unifying framework for probabilistic inference. In Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence (UAI), pages 211-219, 1996.
8. Yousri El Fattah and Rina Dechter. An evaluation of structural paramters for probabilistic reasoning: Results on benchmark circuits. In Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence (UAI), pages 244-251, 1996.
9. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco, CA, 1979.
10. F. V. Jensen, S.L. Lauritzen, and K.G. Olesen. Bayesian updating in recursive graphical models by local computation. Computational Statistics Quarterly, 4:269- 282, 1990.
11. George Karypis, Rajat Aggarwal, Vipin Kumar, and Shashi Shekhar. Multilevel hyper graph partitioning: Applications in vlsi domain. IEEE Transactions on VLSI Systems, 1998.
12. George Karypis and Vipin Kumar. Hmetis: A hypergraph partitioning package. Available at http://www.cs.umn.edu/karypis, 1998.
13. U. Kjaerulff. Triangulation of graphs|algorithms giving small total state space. Technical Report R-90-09, Department of Mathematics and Computer Science, University of Aalborg, Denmark, 1990.
14. S. L. Lauritzen and D. J. Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems. Journal of Royal Statistics Society, Series B, 50(2):157-224, 1988.
15. Nevin Lianwen Zhang and David Poole. Exploiting causal independence in Bayesian network inference. Journal of Artificial Intelligence Research, 5:301-328, 1996.