On the Completeness of Incidence Calculus

Authors: Wang L.1; Wong S.K.M.2; Yao Y.Y.3

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

Publisher: Springer

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

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

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$47.00 plus tax      Refund Policy

 

OR

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A