Mixed deterministic and probabilistic networks

Annals of Mathematics and Artificial Intelligence

Volumn 54, Issue 1-3, 2008, Pages 3-51

  Mateescu, Robert ^a   Dechter, Rina ^b  

^a California Institute of Technology   (United States)

^b Ringgold Standard Institution Informatics   (United States)

Author keywords

AND OR search; Automated reasoning; Deterministic information; Graphical models; Inference; Mixed network; Probabilistic information; Search

Indexed keywords

EID: 70350031352     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-009-9132-y     Document Type: Article

References (47)

1. Allen, D., Darwiche, A.: New advances in inference by recursive conditioning. In: Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence (UAI'03), pp. 2-10 (2003).
2. Bacchus, F., Dalmao, S., Pitassi, T.: Value elimination: Bayesian inference via backtracking search. In: Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence (UAI'03), pp. 20-28 (2003).
3. Bartels, C., Bilmes, J.A.: Non-minimal triangulations for mixed stochastic/deterministic graphical models. In: Proceedings of the Twenty Second Conference on Uncertainty in Artificial Intelligence (UAI'06) (2006).
4. Bayardo, R., Miranker, D.: A complexity analysis of space-bound learning algorithms for the constraint satisfaction problem. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence, pp. 298-304 (1996).
5. Bertele, U., Brioschi, F.: Nonserial Dynamic Programming. Academic, London (1972).
6. Bodlaender, H.L., Gilbert, J.R.: Approximating treewidth, pathwidth and minimum elimination tree-height. Tech. Rep., Utrecht University (1991).
7. Boutilier, C., Friedman, N., Goldszmidt, M., Koller, D.: Context-specific independence in Bayesian networks. In: Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence (UAI'96), pp. 115-123. San Francisco, 1-4 August 1996.
8. Chavira, M., Darwiche, A., Jaeger, M.: Compiling relational Bayesian networks for exact inference. Int. J. Approx. Reason. 42(1-2), 4-20 (2006).
9. Cooper, G.: The computational complexity of probabistic inferences. Artif. Intell. 42, 393-405 (1990).
10. Darwiche, A.: Recursive conditioning. Artif. Intell. 125(1-2), 5-41 (2001).
11. Darwiche, A.: A logical approach to factoring belief networks. In: Proceedings of the Eighth International Conference on Principles of Knowledge Representation and Reasoning (KR'02), pp. 409-420. Toulouse, 22-25 April 2002.
12. Dechter, R.: Bucket elimination: a unifying framework for probabilistic inference algorithms. In: Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence (UAI'96), pp. 211-219. San Francisco, 1-4 August 1996.
13. Dechter, R.: Bucket elimination: a unifying framework for reasoning. Artif. Intell. 113, 41-85 (1999).
14. Dechter, R.: Constraint Processing. Morgan Kaufmann, San Mateo (2003).
15. Dechter, R., Larkin, D.: Hybrid processing of belief and constraints. In: Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence (UAI'01), pp. 112-119. Seattle, August 2001.
16. Dechter, R., Mateescu, R.: Mixtures of deterministic-probabilistic networks and their AND/OR search space. In: Proceedings of the Twentieth Conference on Uncertainty in Artificial Intelligence (UAI'04), pp. 120-129. Banff, 7-11 July 2004.
17. Dechter, R., Mateescu, R.: AND/OR search spaces for graphical models. Artif. Intell. 171(2-3), 73-106 (2007).
18. Dechter, R., Pearl, J.: Network-based heuristics for constraint satisfaction problems. Artif. Intell. 34(1), 1-38 (1987).
19. Freuder, E.C., Quinn, M.J.: Taking advantage of stable sets of variables in constraint satisfaction problems. In: Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI'85), pp. 1076-1078. Los Angeles, 18-23 August 1985.
20. Gaschnig, J.: Performance measurement and analysis of search algorithms. Tech. Rep. CMU-CS-79-124, Carnegie Mellon University (1979).
21. Heckerman, D.: A tractable inference algorithm for diagnosing multiple diseases. In: Proceedings of the Fifth Conference on Uncertainty in Artificial Intelligence (UAI'89), pp. 163-172 (1989).
22. Jaeger, M.: Probabilistic decision graphs-combining verification and AI techniques for probabilistic inference. Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 12, 19-42 (2004).
23. Kask, K., Dechter, R., Larrosa, J., Dechter, A.: Unifying cluster-tree decompositions for reasoning in graphical models. Artif. Intell. 166(1-2), 165-193 (2005).
24. Koller, D., Pfeffer, A.: Probabilistic frame-based systems. In: Proceedings of the Fifteenth National Conference of Artificial Intelligence (AAAI'98), pp. 580-587. Madison, July 1998.
25. Korth, H., Silberschatz, A.: Database System Concepts. McGraw-Hill, New York (1991).
26. Larkin, D., Dechter, R.: Bayesian inference in the presence of determinism. In: The Ninth International Workshop on Artificial Intelligence and Statistics (AISTATS'03). Key West, January 2003.
27. Mateescu, R., Dechter, R.: The relationship between AND/OR search and variable elimination. In: Proceedings of the Twenty First Conference on Uncertainty in Artificial Intelligence (UAI'05), pp. 380-387. Edinburgh, 26-29 July 2005.
28. Mateescu, R., Dechter, R.: AND/OR multi-valued decision diagrams (AOMDDs) for weighted graphical models. In: Proceedings of the Twenty Third Conference on Uncertainty in Artificial Intelligence (UAI'07). Vancouver, July 2007.
29. McEliece, R., MacKay, D., Cheng, J.F.: Turbo decoding as an instance of Pearl's belief propagation algorithm. IEEE J. Sel. Areas Commun. 16(2), 140-152 (1998).
30. Milch, B., Marthi, B., Sontag, D., Russell, S., Ong, D.L., Kolobov, A.: Blog: probabilistic models with unknown objects. In: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI'05), pp. 1352-1359. Edinburgh, 30 July-5 August 2005.
31. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the Design and Automation Conference (DAC'01), pp. 530-535. Las Vegas, June 2001.
32. Ngo, L., Haddawy, P.: Answering queries from context-sensitive probabilistic knowledge bases. Theor. Comp. Sci. 171(1-2), 147-177 (1997).
33. Nilsson, N.J.: Principles of Artificial Intelligence. Tioga, Palo Alto (1980).
34. Ott, J.: Analysis of Human Genetic Linkage. The Johns Hopkins University Press, Baltimore (1999).
35. Otten, L., Dechter, R.: Bounding search space size via (hyper)tree decompositions. In: Proceedings of the Twenty Fourth Conference on Uncertainty in Artificial Intelligence (UAI'08), pp. 452-459. Helsinki, July 2008.
36. Parker, R., Miller, R.: Using causal knowledge to create simulated patient cases: the CPCS project as an extension of INTERNIST-1. In: Proceedings of the Eleventh Symposium on Computer Applications in Medical Care, pp. 473-480. Washington, D.C., November 1987.
37. Pearl, J.: Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, San Francisco (1988).
38. Poole, D.: Probabilistic Horn abduction and Bayesian networks. Artif. Intell. 64, 81-129 (1993).
39. Poole, D.: Probabilistic partial evaluation: exploiting structure in probabilistic inference. In: IJCAI-97: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI'97), pp. 1284-1291. Nagoya, 23-29 August 1997.
40. Portinale, L., Bobbio, A.: Bayesian networks for dependency analysis: an application to digital control. In: Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence (UAI'99), pp. 551-558. Stockholm, 30 July-1 August 1999.
41. Prosser, P.: Hybrid algorithms for constraint satisfaction problems. Comput. Intell. 9(3), 268-299 (1993).
42. Richardson, M., Domingos, P.: Markov logic networks. Mach. Learn. 62(1-2), 107-136 (2006).
43. Rish, I., Dechter, R.: Resolution vs. search; two strategies for SAT. J. Autom. Reason. 24(1/2), 225-275 (2000).
44. Sang, T., Bacchus, F., Beam, P., Kautz, H., Pitassi, T.: Combining component caching and clause learning for effective model counting. In: Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT'04), pp. 20-28. Vancouver, 10-13 May 2004.
45. Shenoy, P.: Valuation-based systems for Bayesian decision analysis. Oper. Res. 40, 463-484 (1992).
46. Wellman, M., Breese, J., Goldman, R.: From knowledge bases to decision models. Knowl. Eng. Rev. 7, 35-53 (1992).
47. Zhang, N., Poole, D.: A simple approach to Bayesian network computations. In: Proceedings of the Tenth Canadian Conference on Artificial Intelligence, pp. 171-178. Seattle, 31 July-4 August 1994.