Recovering incidence functions

  • Weiru Liu
  • Alan Bundy
  • Dave Robertson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 747)


In incidence calculus, inferences usually are made by calculating incidence sets and probabilities of formulae based on a given incidence function in an incidence calculus theory. However it is still the case that numerical values are assigned on some formulae directly without giving the incidence function. This paper discusses how to recover incidence functions in these cases. The result can be used to calculate mass functions from belief functions in the Dempster-Shafer theory of evidence (or DS theory) and define probability spaces from inner measures (or lower bounds) of probabilities on the relevant propositional language set.


Probability Space Mass Function Automate Reasoning Belief Function Focal Element 
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. [1]
    Bundy,A., Incidence calculus: a mechanism for probability reasoning, J. of Automated Reasoning. 1, 263–283, 1985.Google Scholar
  2. [2]
    Bundy,A., Correctness criteria of some algorithms for uncertain reasoning using incidence calculus., J. of Automated reasoning. 2 109–126., 1986.Google Scholar
  3. [3]
    Bundy,A., Incidence Calculus, The Encyclopedia of AI, 663–668, 1992. It is also available as the Research paper No. 497 in the Dept. of Artificial Intelligence, Univ. of Edinburgh.Google Scholar
  4. [4]
    Correa da Silva,F. and A.Bundy, On some equivalent relations between incidence calculus and Dempster-Shafer theory of evidence, Proc. of sixth workshop of Uncertainty in Artificial Intelligence. 378–383, 1990.Google Scholar
  5. [5]
    Fagin,R. and J. Halpern, Uncertainty, belief and probability, Research Report of IBM, RJ 6191, 1989.Google Scholar
  6. [6]
    Kennes,R. Computational aspects of the Moebius transform of a graph, IEEE-SMC, 22:201–223, 1991.Google Scholar
  7. [7]
    Kennes,R. and Smets,Ph., Computational aspects of the Moebius Transform. Proc. of the 6th Conf. on Uncertainty in AI Eds. by P.Bonissone, M.Henrion, L.Kanal and J.Lemmer. Cambridge, MA. North Holland, 401–416, 1990a.Google Scholar
  8. [8]
    Liu,W., Incidence calculus and generalized incidence calculus. Chapter 2 of a forthcoming PhD thesis. Dept. of AI, Univ. of Edinburgh, 1993.Google Scholar
  9. [9]
    Liu,W. and A.Bundy, The combination of different pieces of evidence using incidence calculus, Research Paper 599, Dept. of Artificial Intelligence, Univ. of Edinburgh, 1992.Google Scholar
  10. [10]
    Liu,W., A.Bundy and D.Robertson, On the relationship between incidence calculus and the ATMS, in this proceedings, 1993.Google Scholar
  11. [11]
    Liu, W., A.Bundy and D.Robertson, Recovering incidence functions, forthcoming departmental research paper, 1993.Google Scholar
  12. [12]
    McLean,R.G., Testing and Extending the Incidence Calculus, M.Sc. Dissertation, Dept. of Artificial Intelligence, Univ. of Edinburgh, 1992.Google Scholar
  13. [13]
    Shafer,G., A mathematical theory of evidence, Princeton University Press. 1976.Google Scholar
  14. [14]
    Smets,P., Belief functions, Non-Standard Logics for Automated Reasoning, (Smets, Mamdani, Dubois and Prade Eds.), 253–286, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Weiru Liu
    • 1
  • Alan Bundy
    • 1
  • Dave Robertson
    • 1
  1. 1.Dept. of AIUniv. of EdinburghEdinburgh

Personalised recommendations