Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks

Artificial Intelligence

Volumn 151, Issue 1-2, 2003, Pages 213-225

  Shimony, Solomon E ^a   Domshlak, Carmel ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b School of Operations Research and Information Engineering   (United States)

Author keywords

Bayes networks; Complexity; Probabilistic reasoning; Singly connected DAGs

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBABILISTIC LOGICS; TREES (MATHEMATICS);

BAYES NETWORKS;

ARTIFICIAL INTELLIGENCE;

EID: 0242365710     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(03)00110-3     Document Type: Article

References (31)

1. Abdelbar A., Hedetniemi S. Approximating MAPs for belief networks is NP-hard and other theorems. Artificial Intelligence. 102:1998;21-38.
2. Bubley R., Dyer M. Graph orientations with no sink and an approximation for a hard case of #SAT. Proceedings of Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA. 1997;248-257.
3. Charniak E. Bayesian networks without tears. AI Magazine. 12:(4):1991;50-63.
4. Cooper G.F. The computational complexity of probabilistic inference using Bayesian belief networks. Artificial Intelligence. 42:(2-3):1990;393-405.
5. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1990;MIT Press, Cambridge, MA.
6. Dagum P., Luby M. Approximating probabilistic inference in Bayesian belief networks is NP-hard. Artificial Intelligence. 60:(1):1993;141-153.
7. Darwiche A. Conditioning methods for exact and approximate inference in causal networks. Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence, Montreal, QB. 1995;99-107.
8. Darwiche A. Recursive conditioning. Artificial Intelligence (Special Issue on Resource Bounded Reasoning). 125:(1-2):2000;5-41.
9. Dasgupta S. Learning polytrees. Proceedings of 15th International Conference on Uncertainty in Artificial Intelligence, Stockholm, Sweden. 1999;134-141.
10. Diez F.J. Local conditioning in Bayesian networks. Artificial Intelligence. 87:(1-2):1996;1-20.
11. Domshlak C., Brafman R. Structure and complexity in planning with unary operators. Proceedings of the Sixth International Conference on AI Planning and Scheduling, Toulouse, France. 2002;34-43.
12. Garey M.R., Johnson D.S. Computers and Intractability, A Guide to the Theory of NP-completeness. 1979;W.H. Freeman, New York. p. 190.
13. Horvitz E.J., Suermondt H.J., Cooper G.F. Bounded conditioning: Flexible inference for decisions under scarce resources. Proc. 5th Workshop on Uncertainty in AI, Windsor, ON. 1989;182-193.
14. Jensen F.V., Olsen K.G., Andersen S.K. An algebra of Bayesian belief universes for knowledge-based systems. Networks. 20:1990;637-660.
15. 2) algorithm for single connectedness. Inform. Process. Lett. 72:(3-4):1999;105-107.
16. Kim J.H., Pearl J. A computation model for causal and diagnostic reasoning in inference systems. Proceedings IJCAI-83, Karlsruhe, Germany. 1983;190-193.
17. Lauritzen S.L., Speigelhalter D.J. Local computations with probabilities on graphical structures and their applications to expert systems. J. Royal Statist. Soc. 50:1988;157-224.
18. Lepar V., Shenoy P.P. A comparison of Lauritzen-Spiegelhalter, Hugin, and Shenoy-Shafer architectures for computing marginals of probability distributions. Proceedings of 14th International Conference on Uncertainty in Artificial Intelligence, Madison, WI. 1998;328-337.
19. Neapolitan R.E. Probabilistic Reasoning in Expert Systems. 1990;Wiley, New York.
20. Park J.D. MAP complexity results and approximation methods. Proceedings of Eighteenth Conference on Uncertainty in AI, Edmonton, AB. 2002;388-396 Morgan Kaufmann, San Mateo, CA.
21. Pearl J. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. 1988;Morgan Kaufmann, San Mateo, CA.
22. Peng Y., Reggia J.A. A probabilistic causal model for diagnostic problem solving (parts 1 and 2). IEEE Trans. Systems Man Cybernet. SMC-17:1987;146-162. 395-406.
23. Poole D. Probabilistic Horn abduction and Bayesian networks. Artificial Intelligence. 64:(1):1993;81-129.
24. Poole D. Probabilistic conflicts in a search algorithm for estimating posterior probabilities in Bayesian networks. Artificial Intelligence. 88:(1-2):1996;69-100.
25. Roth D. On the hardness of approximate reasoning. Artificial Intelligence. 82:(1-2):1996;273-302.
26. Santos E. Jr., Shimony S.E. Belief updating by enumerating high-probability independence-based assignments. Uncertainty in AI, Proceedings of the Tenth Conference, Seattle, WA. 1994;506-513.
27. Shachter R.D. Evaluating influence diagrams. Oper. Res. 34:(6):1986;871-882.
28. Shimony S.E. Finding MAPs for belief networks is NP-hard. Artificial Intelligence. 68:(2):1994;399-410.
29. Tsang E. Foundations of Constraint Satisfaction. 1993;Academic Press, New York.
30. Valiant L.G., Vazirani V.V. NP is as easy as detecting unique solutions. Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, Providence, RI. 1985;458-463.
31. Weiss Y. Correctness of local probability propagation in graphical models with loops. Neural Comput. 12:(1):2000;1-41.