On the complexity of inference about probabilistic relational models

Artificial Intelligence

Volumn 117, Issue 2, 2000, Pages 297-308

  Jaeger, Manfred ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; INFERENCE ENGINES; PROBABILITY;

BAYESIAN NETWORKS;

ARTIFICIAL INTELLIGENCE;

EID: 0033906887     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(99)00109-5     Document Type: Article

References (21)

1. Bacchus F. Representing and Reasoning with Probabilistic Knowledge. 1990;MIT Press, Cambridge, MA.
2. Breese J.S. Construction of belief and decision networks. Computational Intelligence. Vol. 8:(4):1992;624-647.
3. Cooper G.F. The computational complexity of probabilistic inference using Bayesian belief networks. Artificial Intelligence. Vol. 42:1990;393-405.
4. Dagum P., Luby M. Approximating probabilistic inference in Bayesian belief networks is NP-hard. Artificial Intelligence. Vol. 60:1993;141-153.
5. Friedman N., Getoor L., Koller D., Pfeffer A. Learning probabilistic relational models. Proc. IJCAI-99, Stockholm, Sweden. 1999.
6. Frisch A., Haddawy P. Anytime deduction for probabilistic logic. Artificial Intelligence. Vol. 69:1994;93-122.
7. Haddawy P. Generating Bayesian networks from probability logic knowledge bases. Proc. 10th Conference on Uncertainty in Artificial Intelligence (UAI-94), Seattle, WA. 1994;262-269.
8. Henrion M. Propagating uncertainty in Bayesian networks by probabilistic logic sampling. Lemmer J.F., Kanal L.N. Uncertainty in Artificial Intelligence, Vol. 2. 1988;149-163 Elsevier Science, Amsterdam.
9. Jaeger M. Relational Bayesian networks. Proc. 13th Conference on Uncertainty in Artificial Intelligence (UAI-97), Providence, RI. 1997.
10. Jaeger M. Convergence results for relational Bayesian networks. Proc. 13th Annual IEEE Symposium on Logic in Computer Science (LICS-98), Indianapolis, IN. 1998.
11. Johnson D.S. A catalog of complexity classes. van Leeuwen J. Handbook of Theoretical Computer Science, Vol. 1. 1990;67-161 Elsevier, Amsterdam.
12. Jones N.D., Selman A.L. Turing machines and the spectra of first-order formulas with equality. Proc. 4th ACM Symposium on Theory of Computing, Denver, CO. 1972;157-167.
13. Koller D., Pfeffer A. Probabilistic frame-based systems. Proc. AAAI-98, Madison, WI. 1998;580-587.
14. Lakshmanan V., Sadri F. Probabilistic deductive databases. Bruynooghe M. Proc. International Symposium on Logic Programming (ILPS-94). 1994;MIT Press, Cambridge, MA.
15. Mahaney S.R. Sparse sets and reducibilities. Book R.V. Studies in Complexity Theory. 1986;63-118 Pitman, London.
16. Ng R., Subrahmanian V. Probabilistic logic programming. Inform. and Comput. Vol. 101:1992;150-201.
17. Ngo L., Haddawy P. Answering queries from context-sensitive probabilistic knowledge bases. Theoret. Comput. Sci. Vol. 171:1997;147-177.
18. Nilsson N. Probabilistic logic. Artificial Intelligence. Vol. 28:1986;71-88.
19. Poole D. Probabilistic Horn abduction and Bayesian networks. Artificial Intelligence. Vol. 64:1993;81-129.
20. Saffiotti A., Umkehrer E. Inference-driven construction of valuation systems from first-order clauses. IEEE Trans. Systems Man Cybernet. Vol. 24:(11):1994;1611-1624.
21. Wellman M.P., Breese J.S., Goldman R.P. From knowledge bases to decision models. The Knowledge Engineering Review. Vol. 7:(1):1992;35-53.