Skip to main content

Modeling uncertain relational knowledge: the AV-quantified production rules approach

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

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 946))

Abstract

Relational knowledge is a very common form of knowledge, which allows direct inferences to be drawn from a premise to a conclusion. This paper focuses on the problem of representing and using relational knowledge affected by uncertainty. We first discuss the intuitive meaning of the uncertainty that may affect relational knowledge and we distinguish between A-uncertainty, concerning the applicability of a relation, and V-uncertainty, concerning the validity of a relation. Then we show how the difference between A-uncertainty and V-uncertainty has received so far only limited attention in various literature proposals. Finally, we introduce an original approach to deal with uncertain relational knowledge based on AV-quantified production rules, and we discuss its main features.

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

  1. Dubois D., Lang J., and Prade H. Automated reasoning using possibilistic logic: Semantics, belief revision, and variable certainty weights, IEEE Trans. on Knowledge and Data Engineering KDE-6(1), 64–71

    Google Scholar 

  2. Dubois D., Lang J., and Prade H. Possibilistic logic, in D.M. Gabbay, C.J.Hogger, and J.A. Robinson (Eds), Handbook of Logic in Artificial Intelligence and Logic Programming, Clarendon Press, Oxford, UK, 1994, 439–513.

    Google Scholar 

  3. Léa Sombé Group. Reasoning under incomplete information in artificial intelligence: A comparison of formalisms using a single example, International journal of Intelligent Systems 5(4), 1990, 323–472.

    Google Scholar 

  4. Nilsson N.J. Probabilistic logic, Artificial Intelligence 28, 1986, 71–87

    Article  Google Scholar 

  5. Pearl J. Bayesian and belief-functions formalisms for evidential reasoning: A conceptual analysis, in G. Shafer and J. Pearl (Eds.) Readings in Uncertain Reasoning, Morgan Kaufmann, San Mateo, CA, 1990, 540–574.

    Google Scholar 

  6. Pearl J. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufmann, San Mateo, CA, 1991.

    Google Scholar 

  7. Reiter R. A logic for default reasoning, Artificial Intelligence 13, 81–132.

    Google Scholar 

  8. Saffiotti A. Using Dempster-Shafer theory in knowledge representation, in P.P. Bonissone, M. Henrion, L.N. Kanal, and J.F. Lemmer (Eds.) Uncertainty in Artificial Intelligence 6, Elsevier, New York, N.Y, 1991, 417–431

    Google Scholar 

  9. Shafer G. A Mathematical Theory of Evidence, Princeton University Press, Princeton, NJ, 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Christine Froidevaux Jürg Kohlas

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baroni, P., Guida, G., Mussi, S. (1995). Modeling uncertain relational knowledge: the AV-quantified production rules approach. In: Froidevaux, C., Kohlas, J. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1995. Lecture Notes in Computer Science, vol 946. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60112-0_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-60112-0_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60112-8

  • Online ISBN: 978-3-540-49438-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics