On the Completeness of Incidence Calculus

Authors: Wang L.¹; Wong S.K.M.²; Yao Y.Y.³

Source: Journal of Automated Reasoning, Volume 16, Number 3, June 1996 , pp. 355-368(14)

Publisher: Springer

Buy & download fulltext article:

Price: $47.00 plus tax (Refund Policy)

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.

Keywords: automatic theorem proving; complete axiomatization; incidence calculus; inference rules; propositional logic; uncertain reasoning

Language: English

Document Type: Regular paper

Affiliations: 1: Department of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada L8S 4K1 2: Department of Computer Science, University of Regina, Regina, SK, Canada S4S 0A2 3: Department of Mathematical Sciences, Lakehead University, Thunder Bay, ON, Canada P7B 5E1

Publication date: 1996-06-01