Resource bounded and anytime approximation of belief function computations

International Journal of Approximate Reasoning

Volumn 31, Issue 1-2, 2002, Pages 103-154

  Haenni, Rolf ^a   Lehmann, Norbert ^b  

^a University of California   (United States)

^b UNIVERSITY OF FRIBOURG   (Switzerland)

Author keywords

Belief functions; Dempster Shafer theory; Fusion algorithm; Incompleteness; Interruptible anytime algorithm; Join tree propagation; Lower and upper approximation

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; FUNCTIONS; SET THEORY; THEOREM PROVING;

BELIEF FUNCTIONS;

APPROXIMATION THEORY;

EID: 0036787875     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0888-613X(02)00074-9     Document Type: Article

References (52)

1. Pearl J. Probabilistic Reasoning in Intelligent Systems. 1988;Morgan Kaufmann, CA.
2. Dempster A. Upper and lower probabilities induced by a multivalued mapping. Annals of Mathematical Statistics. 38:1967;325-339.
3. Shafer G. The Mathematical Theory of Evidence. 1976;Princeton University Press, Princeton, NJ.
4. J. Kohlas, P. Monney, A Mathematical Theory of Hints. An Approach to the Dempster-Shafer Theory of Evidence, Vol. 425 of Lecture Notes in Economics and Mathematical Systems, Springer, 1995
5. Smets Ph., Kennes R. The transferable belief model. Artificial Intelligence. 66:1994;191-234.
6. R. Haenni, J. Kohlas, N. Lehmann, Probabilistic argumentation systems, in: J. Kohlas, S. Moral (Eds.), Handbook of Defeasible Reasoning and Uncertainty Management Systems, Vol. 5, Algorithms for Uncertainty and Defeasible Reasoning, Kluwer Academic Publishers, 2000
7. R. Haenni, N. Lehmann, Probabilistic argumentation systems: a new perspective on Dempster-Shafer theory, International Journal of Intelligent Systems, Special Issue on Dempster-Shafer Theory of Evidence, accepted for publication
8. N. Lehmann, Argumentation systems and belief functions, Ph.D. thesis, University of Fribourg, Switzerland, 2001
9. Orponen P. Dempster's rule of combination is #P-complete. Artificial Intelligence. 44:1990;245-253.
10. Shenoy P.P., Shafer G. Propagating belief functions with local computations. IEEE Expert. 1(3):1986;43-52.
11. Wilson N. A Monte-Carlo algorithm for Dempster-Shafer belief. D'Ambrosio B.D., Smets Ph., Bonissone P.P. Proceedings of the 7th Conference on Uncertainty in Artificial Intelligence. 1991;414-417 Morgan Kaufmann Publishers, CA.
12. Moral S., Wilson N. Markov chain Monte-Carlo algorithms for the calculation of Dempster-Shafer belief. Proceedings of the 12th National Conference on Artificial Intelligence. vol. 1:1994;269-274 AAAI Press, Seattle, Washington.
13. N. Wilson, S. Moral, Fast Markov chain algorithms for calculating Dempster-Shafer belief, in: ECAI'96; 12th European Conference on Artificial Intelligence, Wiley, 1996, pp. 672-678
14. S. Moral, A. Salmerón, A Monte-Carlo algorithm for combining Dempster-Shafer belief based on approximate pre-computation, in: A. Hunter, S. Parsons (Eds.), in: Proceedings of the 5th European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU-99), vol. 1638 of LNAI, Springer, 1999, pp. 305-315
15. Voorbraak F. A computationally efficient approximation of Dempster-Shafer theory. International Journal of Man-Machine Studies. 30(5):1989;525-536.
16. Tessem B. Approximations for efficient computation in the theory of evidence. Artificial Intelligence. 61(2):1993;315-329.
17. Lowrance H., Garvey T., Strat T. A framework for evidential-reasoning systems. Kehler T., Rosenschein S. Proceedings of the 5th National Conference on Artificial Intelligence. vol. 2:1986;896-903 Morgan Kaufmann, CA.
18. Bauer M. Approximations for decision making in the Dempster-Shafer theory of evidence. Horvitz E., Jensen F. Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence (UAI-96). 1996;73-80 Morgan Kaufmann Publishers, CA.
19. Bauer M. Approximation algorithms and decision making in the Dempster-Shafer theory of evidence - an empirical study. International Journal of Approximate Reasoning. 17(2-3):1997;217-237.
20. Dubois D., Prade H. Consonant approximations of belief functions. International Journal of Approximate Reasoning. 4:1990;19-449.
21. Harmanec D. Faithful approximations of belief functions. Laskey K.B., Prade H. Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence (UAI-99). 1999;271-278 Morgan Kaufmann Publishers, CA.
22. Denœux T. Inner and outer approximation of belief structures using a hierarchical clustering approach. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems. 9(4):2001;437-460.
23. Denœux T. Inner and outer clustering approximations of belief structures. Proceedings of the 8th international conference. 2000;125-132 Madrid, Spain.
24. Shenoy P.P. Binary join trees for computing marginals in the Shenoy-Shafer architecture. International Journal of Approximate Reasoning. 17(2-3):1997;239-263.
25. Zilberstein S., Russell S.J. Approximate reasoning using anytime algorithms. Natarajan S. Imprecise and Approximate Computation. 1995;Kluwer Academic Publishers, Dordrecht.
26. Zilberstein S. Using anytime algorithms in intelligent systems. AI Magazine Fall. 1996;71-83.
27. Dean T.L. Intractability and time-dependent planning. Georgeff M.P., Lansky A.L. Proceedings of the 1986 Workshop on Reasoning about Actions and Plans. 1987;245-266 Morgan Kaufmann Publishers, CA.
28. Dean T., Boddy M. An analysis of time-dependent planning. Proceedings of the Seventh National Conference on Artificial Intelligence (AAAI-88). 1988;49-54 MIT Press, Cambridge, MA.
29. Dempster A.P., Kong A. Uncertain evidence and artificial analysis. Journal of Statistical Planning and Inference. 20:1988;355-368.
30. Smets Ph. Belief functions. Smets Ph., Mamdani A., Prade H. Nonstandard logics for automated reasoning. 1988;253-286 Academic Press, London.
31. Lehmann N., Haenni R. An alternative to outward propagation for Dempster-Shafer belief functions. Hunter A., Parsons S. ECSQARU'99. 1999;256-267 Springer, London.
32. G. Shafer, An axiomatic study of computation in hypertrees, Working Paper 232, School of Business, The University of Kansas, 1991
33. R. Haenni, Lehmann N., Implementing belief function computations, International Journal of Intelligent Systems, Special Issue on Dempster-Shafer Theory of Evidence, accepted for publication.
34. Shafer G., Shenoy P. Axioms for probability and belief function propagation. Shafer G., Pearl J. Readings in Uncertain Reasoning. 1990;575-610 Morgan Kaufmann Publishers Inc. San Mateo, California.
35. Shenoy P.P. Valuation-based systems: A framework for managing uncertainty in expert systems. Zadeh L.A., Kacprzyk J. Fuzzy Logic for the Management of Uncertainty. 1992;83-104 John Wiley and Sons, New York.
36. Shenoy P.P. Binary join trees. Horvitz E., Jensen F.V. Uncertainty in Artificial Inteligence. 1996;492-499 Morgan Kaufmann, CA.
37. Shenoy P.P., Kohlas J. Computation in valuation algebras. Gabbay D., Smets Ph. Handbook of Defeasible Reasoning and Uncertainty Management Systems, Volume 5: Algorithms for Uncertainty and Defeasible Reasoning. 2000;5-39 Kluwer Academic Publishers, Dordrecht.
38. Dechter R. Bucket elimination: a unifying framework for reasoning. Artificial Intelligence. 113(1-2):1999;41-85.
39. J. Kohlas, R. Stärk, Information algebras and information systems, Tech. Rep. 96-14, University of Fribourg, Institute of Informatics, 1996.
40. J. Kohlas, Computational theory for information systems, Tech. Rep. 97-07, University of Fribourg, Institute of Informatics, 1997.
41. Kohlas J., Haenni R., Moral S. Propositional information systems. Journal of Logic and Computation. 9(5):1999;651-681.
42. R. Almond, A. Kong, Optimality issues in constructing a Markov tree from graphical models, Research Report A-3, Department of Statistics, Harvard University, November 1991
43. Almond R.G. Graphical Belief Modeling. 1995;Chapman and Hall, London.
44. Cano A., Moral S. Heuristic algorithms for the triangulation of graphs. Bouchon-Meunier B., Yager R., Zadeh L. Proceedings of the Fifth IPMU Conference. 1995;166-171 Springer, Berlin.
45. R. Haenni, N. Lehmann, Efficient hypertree construction, Tech. Rep. 99-03, University of Fribourg, Institute of Informatics, 1999.
46. R. Haenni, N. Lehmann, Belief function propagation based on Shenoy's fusion algorithm, in: IPMU'00, Proceedings of the 8th international conference, Madrid, Spain, 2000, pp. 1928-1931.
47. Jensen F.V., Lauritzen S.L., Olesen K.G. Bayesian updating in causal probabilistic networks by local computations. SIAM Journal on Computing. 4:1990;269-282.
48. Lauritzen S., Spiegelhalter D.J. Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society. 50(2):1988;157-224.
49. Shafer G., Shenoy P.P., Mellouli K. Propagating belief functions in qualitative Markov trees. International Journal of Approximate Reasoning. 1(4):1987;349-400.
50. K. Kask, R. Dechter, J. Larrosa, F. Cozman, Bucket-elimination for automated reasoning, Tech. rep., ICS, Universitiy of California, Irvine, 2001
51. Schmidt T., Shenoy P.P. Some improvements to the Shenoy-Shafer and Hugin architectures for computing marginals. Artificial Intelligence. 102(2):1998;323-333.
52. Kohlas J. Zuverlässigkeit und Verfügbarkeit. 1987;Teubner, Stuttgart.