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

  • Pietro Baroni
  • Giovanni Guida
  • Silvano Mussi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 946)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Dubois et al. 94a]
    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–71Google Scholar
  2. [Dubois et al. 94b]
    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é 90]
    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 86]
    Nilsson N.J. Probabilistic logic, Artificial Intelligence 28, 1986, 71–87CrossRefGoogle Scholar
  5. [Pearl 90]
    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 91]
    Pearl J. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufmann, San Mateo, CA, 1991.Google Scholar
  7. [Reiter 80]
    Reiter R. A logic for default reasoning, Artificial Intelligence 13, 81–132.Google Scholar
  8. [Saffiotti 91]
    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–431Google Scholar
  9. [Shafer 76]
    Shafer G. A Mathematical Theory of Evidence, Princeton University Press, Princeton, NJ, 1976.Google Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Pietro Baroni
    • 1
  • Giovanni Guida
    • 1
  • Silvano Mussi
    • 2
  1. 1.Dipartimento di Elettronica per l'AutomazioneUniversità di BresciaItaly
  2. 2.CILEAMilanoItaly

Personalised recommendations