Skip to main content
SpringerLink
Log in

Computation in Valuation Algebras

  • Chapter
Handbook of Defeasible Reasoning and Uncertainty Management Systems

Part of the book series: Handbook of Defeasible Reasoning and Uncertainty Management Systems ((HAND,volume 5))

Abstract

The main goal of this chapter is to describe an abstract framework called valuation algebra for computing marginals using local computation. The valuation algebra framework is useful in many domains, and especially for managing uncertainty in expert systems using probability, Dempster-Shafer belief functions, Spohnian epistemic belief theory, and possibility theory.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Amborg, S., Cornell, D., & Proskurowski, A. 1987. Complexity of Finding Embedings in a k-Tree. SIAM J. of Algebraic and Discrete Methods,38, 277–284.

    Google Scholar 

  2. Bergstra, J.A., Heering, J., & Klint, R. 1990. Module Algebra. J. of the Association for Computing Machinery,37(2), 335–372.

    Google Scholar 

  3. Bertele, U., & Brioschi, F. 1972. Nonserial Dynamic Programming. Academic Press.

    Google Scholar 

  4. Bissig, R., Kohlas, J., & Lehmann, N. 1997. Fast-Division Architecture for Dempster-Shafer Belief Functions. In:Gabbay, D., Kruse, R., Nonnengart, A., & Ohlbach, H.J. (eds), First Int. Joint Conf on Qualitative and Quantitative Practical Reasoning, ECSQARUFAPR’97,Springer, for Lecture Notes in Artif. Intell.

    Google Scholar 

  5. Cannings, C., Thompson, E.A., & Skolnick, M.H. 1978. Probability Functions on Complex Pedigrees. Advances in Applied Probability,10 26–61.

    Google Scholar 

  6. De Kleer, J. 1986a. An Assumption-based TMS. Artif. Intell., 28, 127–162.

    Article  Google Scholar 

  7. De Kleer, J. 1986b. Extending the ATMS. Artif. Intell., 28, 163–196.

    Article  Google Scholar 

  8. Dempster, A. 1967. Upper and Lower Probabilities Induced by a Multivalued Map-ping. Ann. Math. Stat., 38, 325–339.

    Article  Google Scholar 

  9. Henkin, L., Monk, J. D., & Tarski, A. 1971. Cylindric Algebras. Studies in logic and the foundations of mathematics, vol. 65,115. North-Holland.

    Google Scholar 

  10. Jensen, F.V., Lauritzen, S.L., & Olesen, K.G. 1990a. Bayesian Updating in Causal Probabilistic Networks by Local Computation. Computational Statistics Quarterly,4 269–282.

    Google Scholar 

  11. Jensen et al.,1990bl Jensen, F.V., Lauritzen, S.L., & Olesen, K.G. 1990b. Bayesian Updating in Causal Probabilistic Networks by Local Computations. Comp. Stat. Q., 4,269–282.

    Google Scholar 

  12. Kjærulff, U. 1990. Triangulation of Graphs-Algorithms giving Small Total Space. Tech. rept. R90–09. Department of Mathematics and Computer Science, Aalborg University, Denmark.

    Google Scholar 

  13. Kohlas, J. 1997. Computational Theory for Information Systems. Tech. rept. 97–07. University of Fribourg, Institute of Informatics.

    Google Scholar 

  14. Kohlas, J., & Monney, P.A. 1995. A Mathematical Theory of Hints. An Approach to the Dempster-Shafer Theory of Evidence. Lecture Notes in Economics and Mathematical Systems, vol. 425. Springer.

    Google Scholar 

  15. Kohlas, J., & Moral, S. 1996. Propositional Information Systems. Tech. rept. 96–01. University of Fribourg, Institute of Informatics.

    Google Scholar 

  16. Kohlas, J., & Stärk, R.F. 1996a. Eine mathematische Theorie der Informationssysteme. Tech. rept. 96–12. University of Fribourg, Institute of Informatics.

    Google Scholar 

  17. Kohlas, J., & Stark, R.F. 1996b. Information Algebras and Information Systems. Tech. rept. 96–14. University of Fribourg, Institute of Informatics.

    Google Scholar 

  18. Kohlas, J., Moral, S., & Haenni, R. 1998. Propositional Information Systems. Journal of Logic and Computation,9 657–681, 1999.

    Google Scholar 

  19. Kong, A. 1986. Multivariate Belief Functions and Graphical Models. Ph.D. thesis, Department of Statistics, Harvard University.

    Google Scholar 

  20. Lauritzen, S.L., & Jensen, F.V. 1997. Local Computation with Valuations from a Commutative Semigroup. Annals of Mathematics and Artificial Intelligence, 21 (1), 51–70.

    Article  Google Scholar 

  21. Lauritzen, S.L., & Spiegelhalter, D.J. 1988. Local Computations with Probabilities on Graphical Structures and their Application to Expert Systems. J. of Royal Stat. Soc., 50 (2), 157–224.

    Google Scholar 

  22. Lepar, V., & Shenoy, P.P. 1998. A Comparison of Lauritzen-Spiegelhalter, Hugin and Shenoy-Shafer Architectures for Computing Marginals of Probability Distributions. Pages 328–337 of Cooper, G., & Moral, S. (eds), Uncertainty in Artificial Intelligence: Proceedings of the Fourteenth Conference. Morgan Kaufmann, San Francisco.

    Google Scholar 

  23. Maier, D. 1983. The Theory of Relational Databases. Computer Science Press.

    Google Scholar 

  24. Mellouli, K. 1988. On the Propagation of Beliefs in Networks Using the Dempster-Shafer Theory of Evidence. Ph.D. thesis, School of Business, University of Kansas.

    Google Scholar 

  25. Mengin, J., & Wilson, N. 1999. Logical Deduction using the Local Com-putation Framework. Pages 386–396 of: Hunter, A., & Parsons, S. (eds), European Conf. EC-SQARU’99, London, Springer, for Lecture Notes in Artif. Intell.

    Google Scholar 

  26. Olmsted, S. 1983. On representing and solving decision problems. Ph.D. thesis, Department of Engineering-Economic Systems, Stanford University.

    Google Scholar 

  27. Renardel de Lavalette, G.R. 1992. Logical semantics of modularisation. Pages 306–315 of: Jäger, G., Kleine Büning, H., & Richter, M.M. (eds), Computer Science Logic, selected apers from CSL’91. Springer, Lecture Notes in Computer Science 626.

    Google Scholar 

  28. Rose, D.J. 1970. Triangulated Graphs and the Elimination Process. J. of Math. Analysis and Applications, 32, 597–609.

    Article  Google Scholar 

  29. Schmidt, T., & Shenoy, P.P. 1998. Some Improvements to the Shenoy-Shafer and Hugin Architectures for Computing Marginals. Artif Intell., 102, 323–333.

    Article  Google Scholar 

  30. Shafer, G. 1976. The Mathematical Theory of Evidence. Princeton University Press.

    Google Scholar 

  31. Shafer, G. 1991. An Axiomatic Study of Computation in Hypertrees. Working Paper 232. School of Business, University of Kansas.

    Google Scholar 

  32. Shafer, G., Shenoy, P.P., & Mellouli, K. 1987. Propagating Belief FUnctions in Qualitative Markov Trees. Int. J. of Approximate Reasoning,1(4) 349–400.

    Google Scholar 

  33. Shenoy, P.P. 1989. A Valuation-Based Language For Expert Systems. Int. J. of Approximate Reasoning, 3, 383–411.

    Article  Google Scholar 

  34. Shenoy, P.P. 1991a. On Spohn’s Rule for Revision of Beliefs. Int. J. of Approximate Reasoning, 5 (2), 149–181.

    Article  Google Scholar 

  35. Shenoy, P.P. 1991b. Valuation-Based Systems for Discrete optimization. Pages 385400 of: Bonissone, P.P., Henrion, M., Kanal, L.N., & Lemmer, J.F. (eds), Uncertainty in Artificial Intelligence, 6. North-Holland, Amsterdam.

    Google Scholar 

  36. Shenoy, P.P. 1992a. Using Possibility Theory in Expert Systems. Fuzzy Sets and Systems, 51 (2), 129–142.

    Article  Google Scholar 

  37. Shenoy, P.P. 1992b. Valuation-Based Systems: A Framework for Managing Uncertainty in Expert Systems. Pages 83–104 of: Zadeh, L.A., & Kacprzyk, J. (eds), Fuzzy Logic for the Management of Uncertainty. John Wiley & Sons.

    Google Scholar 

  38. Shenoy, P.P. 1994a. Conditional Independence in Valuation-based Systems. Int. J. of Approximate Reasoning, 10, 203–234.

    Article  Google Scholar 

  39. Shenoy, P.P. 1994b. Consistency in Valuation-Based Systems. ORSA Journal on Computing, 6 (3), 281–291.

    Article  Google Scholar 

  40. Shenoy, P.P. 1996. Axioms for Dynamic Programming. Pages 259–275 of: Gammer-man, A. (ed), Computational Learning and Probabilistic Reasoning. Wiley, Chichester, UK.

    Google Scholar 

  41. Shenoy, P.P. 1997. Binary Join Trees for Computing Marginals in the Shenoy-Shafer Architecture. Int. J. of Approximate Reasoning, 17 (2–3), 239–263.

    Article  Google Scholar 

  42. Shenoy, P.P., & Shafer, G. 1990. Axioms for Probability and Belief Function Propagation. Pages 169–198 of. R.D. Shachter, T.S. Levitt, J.F. Lemmer, & Kanal, L.N. (eds), Uncertainty in Artif. Intel!. 4. North Holland.

    Google Scholar 

  43. Spohn, W. 1988: Ordinal conditional functions: A dynamic theory of epistemic states. Pages 105–134 of: Harper, W.L., & Skyrms, B. (eds), Causation in Decision, Belief Change, and Statistics, vol. 2. Dordrecht, Netherlands.

    Google Scholar 

  44. Stärk-Lepar, V. 1999. Performance of Architectures for Local Computations in Bayesian Networks. Ph.D. thesis, University of Fribourg, Institute of Informatics.

    Google Scholar 

  45. Xu, H. 1991. An Efficient Implementation of Belief Function Propagation. Tech. rept. 91–4. IRIDIA, Université Libre de Bruxelles.

    Google Scholar 

  46. Xu, H. 1995. Computing Marginals for Arbitrary Subsets from Marginal Representation in Markov Trees. Artif. Intel!., 74, 177–189.

    Article  Google Scholar 

  47. Xu, H., & Kennes, R. 1994. Steps Toward Efficient Implementation of Dempster-Shafer Theory. Pages 153–174 of. Yager, R.R., Fedrizzi, M., & Kacprzyk, J. (eds), Advances in the Dempster-Shafer Theory of Evidence. John Wiley & Sons.

    Google Scholar 

  48. Zadeh, L.A. 1978. Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets and Systems, 1, 3–28.

    Google Scholar 

  49. Zadeh, L.A. 1979. A Theory of Approximate Reasoning. Pages 149–194 of: Ayes, J.E., Michie, D., & Mikulich, L.I. (eds), Machine Intelligence, vol. 9. Ellis Horwood, Chichester, UK.

    Google Scholar 

  50. Zhang, L. 1988. Studies on Finding Hypertree Covers of Hupergraphs. Working Paper 198. School of Business, University of Kansas, Lawrence, KS.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics IIUF, University of Fribourg, CH - 1700, Fribourg, Switzerland

    Jürg Kohlas

  2. Kansas University Business School, Summerfield Hall, KS, 66045-2003, USA

    Prakash P. Shenoy

Authors
  1. Jürg Kohlas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Prakash P. Shenoy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Fribourg, Switzerland

    Jürg Kohlas

  2. Universidad de Granada, Spain

    Serafín Moral

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Kohlas, J., Shenoy, P.P. (2000). Computation in Valuation Algebras. In: Kohlas, J., Moral, S. (eds) Handbook of Defeasible Reasoning and Uncertainty Management Systems. Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol 5. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1737-3_2

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-1737-3_2

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-5603-0

  • Online ISBN: 978-94-017-1737-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation