Skip to main content

Symbolic evidence, arguments, supports and valuation networks

  • Conference paper
  • First Online:
Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 747))

Abstract

Starting from assumption-based propositional knowledge bases, symbolic evidence theory is developed. It is shown to be the qualitative equivalent of the well known numerical evidence theory (Dempster-Shafer theory). In particular it is shown how symbolic evidence fits into the framework of the axiomatic theory of valuation nets of Shenoy, Shafer (1990). This leads then to a local combination scheme for propagating symbolic arguments and supports similar to the methods of propagating probability or belief functions.

Research supported by grants No. 21-30186.90 and 21-32660.91 of the Swiss National Foundation for Research, Esprit Basic Research Activity Project DRUMSII (Defeasible Reasoning and Uncertainty Management)

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • ALMOND, R.; KONG, A. (1991): Optimality Issues in Constructing Markov Tree from Graphical Models. Res. Rep. A-3, Harvard Univ., Dept. of Stat.

    Google Scholar 

  • ARNBORG, S.; CORNEIL, D.G.; PROSKUROWSKI, A. (1987): Complexity of Finding Embeddings in a k-Tree, SIAM J. Algebraic and Discrete Methods, 8, 277–284.

    Google Scholar 

  • BERTELE,U.; BRIOSCHI, F. (1972): Nonserial Dynamic Programming. Academic Press.

    Google Scholar 

  • CHANG, C.L.; LEE, R.C.T. (1973): Symbolic and Mechanical Theorem Proving. Boston.

    Google Scholar 

  • DEMPSTER, A. (1967): Upper and Lower Probabilities Induced by a. Multivalued Mapping. Annals Math. Stat., 38, 325–339.

    Google Scholar 

  • INOUE, K. (1991): Consequence-Finding Based on Ordered Resolution. Proc. IJCAI-91, 158–164.

    Google Scholar 

  • INOUE, K. (1992): Linear Resolution for Consequence Finding. Artificial Intelligence, 56, 301–353.

    Google Scholar 

  • KOHLAS, J. (1991): The Reliability of Reasoning with Unreliable Arguments. Annals of Operations Reseaarch, 32, 76–113.

    Google Scholar 

  • KOHLAS, J. (1993): Symbolic Evidence, Arguments, Supports and Valuation Networks. Institute for Informatics, University of Fribourg, Tech. Rep.

    Google Scholar 

  • KOHLAS, J.; MONNEY, P.A. (1993): Probabilistic Assumption-Based Reasoning. Inst. for Automation and Op. Res., University of Fribourg, Switzerland, Tech. Rep. No. 208.

    Google Scholar 

  • KONG, A. (1986): Multivariate Belief Functions and Graphical Models. Doct. diss. Harvard Univ., Dept. of Stat.

    Google Scholar 

  • LASKEY, K.B.; LEHNER, P.E. (1989): Assumptions, Beliefs and Probabilities. Artificial Intelligence, 41, 65–77.

    Google Scholar 

  • MELLOULI, K. (1987): On the Propagation of Beliefs in Networks Using the Dempster-Shafer Theory of Evidence. Doct. Diss., Univ. of Kansas, School of Business.

    Google Scholar 

  • PROVAN, G.M. (1990): A Logic-Based Analysis of Dempster-Shafer Theory. Int. J. Approximate Reasoning, 4, 451–495.

    Google Scholar 

  • REITER R., DE KLEER, J. (1987): Foundations of Assumption-Based Truth Maintenance Systems. Proc. Amer. Assoc. A.I., 183–188.

    Google Scholar 

  • ROSE, D.J. (1970): Triangulated Graphs and the Elimination Process. J. Math. Anal. and Appl., 32, 597–609.

    Google Scholar 

  • SHAFER, G. (1976 a): A Mathematical Theory of Evidence. Princeton University Press.

    Google Scholar 

  • SHAFER, G. (1976 b): A Theory of Statistical Evidence. In: HARPER, HOOKER (eds.): Foundations of Probability Theory, Statistical Inference, and Statistical Theories of Science. Vol. II, Reidel, Dortrecht, 365–463.

    Google Scholar 

  • SHAFER, G. (1979): Allocations of Probability. Annals of Prob., 7, 827–839.

    Google Scholar 

  • SHENOY, P.P.; SHAFER, G. (1990): Axioms for Probability and Belief-Function Propagation. In: SHACHTER et al. (Eds.) (1990): Uncertainty in Artificial Intelligence 4, 575–610.

    Google Scholar 

  • SIEGEL, P. (1987): Représentation et utilisation de la connaissance en calcul propositionnel. Ph. D. thesis, Univ. de Marseilles II.

    Google Scholar 

  • TARJAN, R.E.; YANNAKAKIS, M. (1984): Simple Linear Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. SIAM J. Computing, 13, 566–579.

    Google Scholar 

  • ZHANG, L. (1988): Studies on Finding Hypertree Covers for Hypergraphs. Working Paper No. 198, Univ. of Kansas, School of Business.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Michael Clarke Rudolf Kruse Serafín Moral

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kohlas, J. (1993). Symbolic evidence, arguments, supports and valuation networks. In: Clarke, M., Kruse, R., Moral, S. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1993. Lecture Notes in Computer Science, vol 747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028200

Download citation

  • DOI: https://doi.org/10.1007/BFb0028200

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57395-1

  • Online ISBN: 978-3-540-48130-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics