Symbolic evidence, arguments, supports and valuation networks

  • Jürg Kohlas
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 747)


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.


Belief Function Disjunctive Normal Form Evidence Theory Basic Argument Axiomatic Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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
  2. 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
  3. BERTELE,U.; BRIOSCHI, F. (1972): Nonserial Dynamic Programming. Academic Press.Google Scholar
  4. CHANG, C.L.; LEE, R.C.T. (1973): Symbolic and Mechanical Theorem Proving. Boston.Google Scholar
  5. DEMPSTER, A. (1967): Upper and Lower Probabilities Induced by a. Multivalued Mapping. Annals Math. Stat., 38, 325–339.Google Scholar
  6. INOUE, K. (1991): Consequence-Finding Based on Ordered Resolution. Proc. IJCAI-91, 158–164.Google Scholar
  7. INOUE, K. (1992): Linear Resolution for Consequence Finding. Artificial Intelligence, 56, 301–353.Google Scholar
  8. KOHLAS, J. (1991): The Reliability of Reasoning with Unreliable Arguments. Annals of Operations Reseaarch, 32, 76–113.Google Scholar
  9. KOHLAS, J. (1993): Symbolic Evidence, Arguments, Supports and Valuation Networks. Institute for Informatics, University of Fribourg, Tech. Rep. Google Scholar
  10. 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
  11. KONG, A. (1986): Multivariate Belief Functions and Graphical Models. Doct. diss. Harvard Univ., Dept. of Stat.Google Scholar
  12. LASKEY, K.B.; LEHNER, P.E. (1989): Assumptions, Beliefs and Probabilities. Artificial Intelligence, 41, 65–77.Google Scholar
  13. 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
  14. PROVAN, G.M. (1990): A Logic-Based Analysis of Dempster-Shafer Theory. Int. J. Approximate Reasoning, 4, 451–495.Google Scholar
  15. REITER R., DE KLEER, J. (1987): Foundations of Assumption-Based Truth Maintenance Systems. Proc. Amer. Assoc. A.I., 183–188.Google Scholar
  16. ROSE, D.J. (1970): Triangulated Graphs and the Elimination Process. J. Math. Anal. and Appl., 32, 597–609.Google Scholar
  17. SHAFER, G. (1976 a): A Mathematical Theory of Evidence. Princeton University Press.Google Scholar
  18. 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
  19. SHAFER, G. (1979): Allocations of Probability. Annals of Prob., 7, 827–839.Google Scholar
  20. 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
  21. SIEGEL, P. (1987): Représentation et utilisation de la connaissance en calcul propositionnel. Ph. D. thesis, Univ. de Marseilles II.Google Scholar
  22. 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
  23. ZHANG, L. (1988): Studies on Finding Hypertree Covers for Hypergraphs. Working Paper No. 198, Univ. of Kansas, School of Business.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Jürg Kohlas
    • 1
  1. 1.Institute for InformaticsUniversity of FribourgFribourgSwitzerland

Personalised recommendations