Skip to main content
Log in

On the completeness of incidence calculus

  • Research Article
  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

Incidence calculus is a mechanism for uncertain reasoning originally introduced by Bundy. He suggested a set of inference rules for deriving new incidence bounds from a given set of lower and upper bounds of some propositions. However, it is important to demonstrate that the inference axioms are complete in any axiomatization. It is proved in this paper that inference rules used by Bundy are indeed complete.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Bundy, A.: Incidence calculus: A mechanism for probabilistic reasoning, J. Automated Reasoning 1 (1985), 263–283.

    Article  MathSciNet  Google Scholar 

  2. Bundy, A.: Correctness criteria of some algorithms for uncertain reasoning using incidence calculus, J. Automated Reasoning 2 (1986), 109–126.

    Article  MathSciNet  Google Scholar 

  3. Bundy, A.: Incidence calculus, in The Encyclopedia of AI, 1992, pp. 663–668.

  4. Correa da Silva, F. and Bundy, A.: On some equivalence relations between incidence calculus and Dempster-Shafer theory of evidence, in Proc. 6th Int. Workshop on Uncertainty in Artificial Intelligence, Cambridge, MA, 1990, pp. 378–383.

  5. Lingras, P. J. and Wong, S. K. M.: Two perspectives of the Dempster-Shafer theory of belief functions, Int. J. Man-machine Studies 33 (1990), 467–487.

    Article  Google Scholar 

  6. Liu, W., Bundy, A., and Robertson, D.: Recovering incidence functions, in Proc. Symbolic and Quantitative Approaches to Reasoning and Uncertainty, Lecture Notes in Computer Science 747, 1993, pp. 241–248.

  7. Mamdani, E. and Gaines, B. (eds): Fuzzy Reasoning and Its Applications, Academic Press, New York, 1981.

    MATH  Google Scholar 

  8. Nilsson, N.: Probabilistic logic, Artificial Intelligence 28 (1987), 71–87.

    Article  MathSciNet  Google Scholar 

  9. Pawlak, Z.: Rough sets, Int. J. Computer and Information Sci. 11 (1982), 341–356.

    Article  MathSciNet  Google Scholar 

  10. Shafer, G.: A Mathematical Theory of Evidence, Princeton University Press, Princeton, 1976.

    MATH  Google Scholar 

  11. Shoenfield, J. R.: Mathematical Logic, Addison-Wesley, Reading, MA, 1967.

    MATH  Google Scholar 

  12. Shortliffe, E. H.: Computer-Based Medical Consultations: MYCIN, North-Holland, New York, 1976.

    Google Scholar 

  13. Wong, S. K. M., Wang, L., and Yao, Y. Y.: Interval structures: A framework for representing uncertain information, in Proc. 8th Conf. Uncertainty in Artificial Intelligence, 1992, pp. 336–343.

  14. Yao, Y. Y., Wong, S. K. M., and Wang, L.: A nonnumeric approach to uncertain reasoning, Int. J. General Systems, in press.

  15. Yao, Y. Y.: Interval-set algebra for qualitative knowledge representation, in Proc. 5th Int. Conf. Computing and Information, 1993, pp. 370–374.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, L., Wong, S.K.M. & Yao, Y.Y. On the completeness of incidence calculus. Journal of Automated Reasoning 16, 355–368 (1996). https://doi.org/10.1007/BF00252181

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

AMS Subject Classification

Key words