A Prototypical System for Soft Evidential Update

Autonomous agents that communicate using probabilistic information and use Bayesian networks for knowledge representation need an update mechanism that goes beyond conditioning on the basis of evidence. In a related paper (M. Valtorta, Y.G. Kim, and J. Vomlel, International Journal of Approximate Reasoning, vol. 29, no. 1, pp. 71–106, 2002), we describe this mechanism, which we call soft evidential update, its properties, and algorithms to realize it. Here, we describe an implementation of the most promising such algorithm, the big clique algorithm, together with examples of its use.

[1]  Marco Valtorta,et al.  Agent-encapsulated bayesian networks , 1998 .

[2]  Joseph Y. Halpern,et al.  Probability Update: Conditioning vs. Cross-Entropy , 1997, UAI.

[3]  Enrique F. Castillo,et al.  A new method for efficient symbolic propagation in discrete Bayesian networks , 1996, Networks.

[4]  Uue Kjjrull.  Triangulation of Graphs { Algorithms Giving Small Total State Space Triangulation of Graphs { Algorithms Giving Small Total State Space , 1990 .

[5]  Victor R. Lesser,et al.  Justifying multiply sectioned Bayesian networks , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[6]  I. Csiszár.  $I$-Divergence Geometry of Probability Distributions and Minimization Problems , 1975 .

[7]  Radim Jirousek,et al.  Solution of the marginal problem and decomposable distributions , 1991, Kybernetika (Praha).

[8]  Adnan Darwiche,et al.  A differential approach to inference in Bayesian networks , 2000, JACM.

[9]  Young-Gyun Kim,et al.  Time-critical decision making with communicating influence diagrams , 2001 .

[10]  J. Pearl.  Jeffrey's Rule, Passage of Experience, and Neo-Bayesianism , 1990 .

[11]  S. Haberman,et al.  The analysis of frequency data , 1974 .

[12]  Richard E. Neapolitan,et al.  Probabilistic reasoning in expert systems - theory and algorithms , 2012 .

[13]  David J. Spiegelhalter,et al.  Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

[14]  Prakash P. Shenoy,et al.  Probability propagation , 1990, Annals of Mathematics and Artificial Intelligence.

[15]  Finn Verner Jensen,et al.  Gradient Descent Training of Bayesian Networks , 1999, ESCQARU.

[16]  Dan Geiger,et al.  A sufficiently fast algorithm for finding close to optimal clique trees , 2001, Artif. Intell..

[17]  Henry E. Kyburg,et al.  Bayesian and Non-Bayesian Evidential Updating , 1987, Artificial Intelligence.

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

[19]  Steffen L. Lauritzen,et al.  Local computation with valuations from a commutative semigroup , 1997, Annals of Mathematics and Artificial Intelligence.

[20]  Judea Pearl,et al.  A Theory of Inferred Causation , 1991, KR.

[21]  Yang Xiang,et al.  A Probabilistic Framework for Cooperative Multi-Agent Distributed Interpretation and Optimization of Communication , 1996, Artif. Intell..

[22]  Jirí Vomlel,et al.  Soft evidential update for probabilistic multiagent systems , 2002, Int. J. Approx. Reason..

[23]  Jiri Vomlel.  Methods Of Probabilistic Knowledge Integration , 1999 .