Edinburgh Research Archive >
Informatics, School of >
Informatics Publications >
Please use this identifier to cite or link to this item:
|Title: ||Correctness criteria of some algorithms for uncertain reasoning using Incidence Calculus|
|Authors: ||Bundy, Alan|
|Issue Date: ||Jun-1986|
|Journal Title: ||Journal of Automated Reasoning|
|Page Numbers: ||109-126|
|Abstract: ||Incidence Calculus is a technique for associating uncertainty values with logical sentences. These uncertainty values are called incidences and they are sets of points, which may be thought of as representing equivalence classes of situations, Tarskian models, or possible worlds. Incidence Calculus was originally introduced in .
Incidence Calculus was designed to overcome various inherent problems with purely numeric mechanisms for uncertain reasoning . In particular, incidences can represent the dependence between sentences, which numbers cannot, and hence Incidence Calculus can provide genuine, probabilistic reasoning.
In this paper we prove soundness and completeness results for some algorithms introduced in  and hence satisfy some of the correctness criteria for Incidence Calculus. These algorithms can be used for probabilistic reasoning and to check the consistency of the subjective probabilities of sentences.|
|Keywords: ||Incidence Calculus|
|Appears in Collections:||Informatics Publications|
Items in ERA are protected by copyright, with all rights reserved, unless otherwise indicated.