On the Relation between Kappa Calculus and Probabilistic Reasoning

We study the connection between kappa calculus and probabilistic reasoning in diagnosis applications. Specifically, we abstract a probabilistic belief network for diagnosing faults into a kappa network and compare the ordering of faults computed using both methods. We show that, at least for the example examined, the ordering of faults coincide as long as all the causal relations in the original probabilistic network are taken into account. We also provide a formal analysis of some network structures where the two methods will differ. Both kappa rankings and infinitesimal probabilities have been used extensively to study default reasoning and belief revision. But little has been done on utilizing their connection as outlined above. This is partly because the relation between kappa and probability calculi assumes that probabilities are arbitrarily close to one (or zero). The experiments in this paper investigate this relation when this assumption is not satisfied. The reported results have important implications on the use of kappa rankings to enhance the knowledge engineering of uncertainty models.

[1]  Moisés Goldszmidt,et al.  Reasoning with Qualitative Probabilities Can Be Tractable , 1992, UAI.

[2]  J. Pearl,et al.  On the Logic of Iterated Belief Revision , 1994, Artif. Intell..

[3]  Judea Pearl,et al.  On the Logic of Iterated Belief Revision , 1994, Artif. Intell..

[4]  P G rdenfors,et al.  Knowledge in flux: modeling the dynamics of epistemic states , 1988 .

[5]  M. Goldszmidt Qualitative probabilities: a normative framework for commonsense reasoning , 1992 .

[6]  Eugene Charniak,et al.  Bayesian Networks without Tears , 1991, AI Mag..

[7]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[8]  Prakash P. Shenoy,et al.  A valuation-based language for expert systems , 1989, Int. J. Approx. Reason..

[9]  David Poole,et al.  Average-Case Analysis of a Search Algorithm for Estimating Prior and Posterior Probabilities in Bayesian Networks with Extreme Probabilities , 1993, IJCAI.

[10]  Prakash P. Shenoy,et al.  On Spohn's rule for revision of beliefs , 1991, Int. J. Approx. Reason..

[11]  Wolfgang Spohn,et al.  Ordinal Conditional Functions: A Dynamic Theory of Epistemic States , 1988 .

[12]  Daniel Hunter Parallel belief revision , 1988, UAI.

[13]  Michael P. Wellman Fundamental Concepts of Qualitative Probabilistic Networks , 1990, Artif. Intell..

[14]  Daniel Hunter Non-monotonic Reasoning and the Reversibility of Belief Change , 1991, UAI.

[15]  Hector Geffner,et al.  Default reasoning - causal and conditional theories , 1992 .

[16]  Matthew L. Ginsberg,et al.  A Symbolic Generalization of Probability Theory , 1992, AAAI.

[17]  Wolfgang Spohn,et al.  A general non-probabilistic theory of inductive reasoning , 2013, UAI.