AND/OR multi-valued decision diagrams (AOMDDs) for weighted graphical models

Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence, UAI 2007

Volumn , Issue , 2007, Pages 276-284

  Mateescu, Robert ^a   Dechter, Rina ^a  

^a 5226 Donald Bren Hall   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CANONICAL REPRESENTATIONS; COMPILATION METHODS; CONSTRAINT NETWORKS; EXPERIMENTAL EVALUATION; GRAPHICAL MODEL; MULTI-VALUED DECISION DIAGRAMS; ORDERED BINARY DECISION DIAGRAMS; PATHWIDTH; PROBABILISTIC MODELING; PROBABILISTIC MODELS; SEARCH SPACES; SEARCH-BASED; TREE-WIDTH; VARIABLE ELIMINATION; WEIGHTED MODELS;

ARTIFICIAL INTELLIGENCE; DECISION THEORY; GRAPHIC METHODS; SPEECH RECOGNITION; VERY LONG INSTRUCTION WORD ARCHITECTURE;

BINARY DECISION DIAGRAMS;

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

References (18)

1. R. Bayardo and D. Miranker. A complexity analysis of space-bound learning algorithms for the constraint satisfaction problem. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, pages 298-304, 1996.
2. U. Bertele and F. Brioschi. Nonserial Dynamic Programming. Academic Press, 1972.
3. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transaction on Computers, 35:677-691, 1986.
4. M. Chavira and A. Darwiche. Compiling bayesian networks using variable elimination. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, pages 2443-2449, 2007.
5. E.M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
6. A. Darwiche. Recursive conditioning. Artificial Intelligence, 125(1-2):5-41, 2001. (Pubitemid 32196230)
7. A. Darwiche and P. Marquis. A knowledge compilation map. Journal of Artificial Intelligence Research (JAIR), 17:229-264, 2002.
8. R. Dechter. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113:41-85, 1999. (Pubitemid 30542742)
9. R. Dechter and R. Mateescu. AND/OR search spaces for graphical models. Artificial Intelligence, 171(2-3):73-106, 2007. (Pubitemid 46328845)
10. H. Fargier and M. Vilarem. Compiling csps into tree-driven automata for interactive solving. Constraints, 9(4):263-287, 2004. (Pubitemid 40672186)
11. E. C. Freuder and M. J. Quinn. Taking advantage of stable sets of variables in constraint satisfaction problems. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI'85), pages 1076-1078, 1985.
12. C.Y. Lee. Representation of switching circuits by binary-decision programs. Bell System Technical Journal, 38:985-999, 1959.
13. R. Mateescu and R. Dechter. Compiling constraint networks into AND/OR multi-valued decision diagrams (AOMDDs). In Proceedings of the Twelfth International Conference on Principles and Practice of Constraint Programming (CP'06), pages 329-343, 2006. (Pubitemid 44618749)
14. D. McAllester, M. Collins, and F. Pereira. Case-factor diagrams for structured probabilistic modeling. In Proceedings of the Twentieth Conference on Uncertainty in Artificial Intelligence (UAI'04), pages 382-391, 2004.
15. K. L. McMillan. Symbolic Model Checking. Kluwer Academic, 1993.
16. S. Minato, K. Satoh, and T. Sato. Compiling bayesian networks by symbolic probability calculation based on zero-suppressed bdds. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, pages 2550-2555, 2007.
17. P.P. Shenoy. Valuation-based systems for bayesian decision analysis. Operations Research, 40:463-484, 1992.
18. Nic Wilson. Decision diagrams for the computation of semiring valuations. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI'05), pages 331-336, 2005.