Using ROBDDs for Inference in Bayesian Networks with Troubleshooting as an Example

01/16/2013
by   Thomas D. Nielsen, et al.
0

When using Bayesian networks for modelling the behavior of man-made machinery, it usually happens that a large part of the model is deterministic. For such Bayesian networks deterministic part of the model can be represented as a Boolean function, and a central part of belief updating reduces to the task of calculating the number of satisfying configurations in a Boolean function. In this paper we explore how advances in the calculation of Boolean functions can be adopted for belief updating, in particular within the context of troubleshooting. We present experimental results indicating a substantial speed-up compared to traditional junction tree propagation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/06/2013

A Generalization of the Noisy-Or Model

The Noisy-Or model is convenient for describing a class of uncertain rel...
research
01/16/2013

Computational Investigation of Low-Discrepancy Sequences in Simulation Algorithms for Bayesian Networks

Monte Carlo sampling has become a major vehicle for approximate inferenc...
research
01/30/2013

A Hybrid Algorithm to Compute Marginal and Joint Beliefs in Bayesian Networks and Its Complexity

There exist two general forms of exact algorithms for updating probabili...
research
03/20/2013

Theory Refinement on Bayesian Networks

Theory refinement is the task of updating a domain theory in the light o...
research
05/31/2019

Concurrency in Boolean networks

Boolean networks (BNs) are widely used to model the qualitative dynamics...
research
01/10/2013

Hybrid Processing of Beliefs and Constraints

This paper explores algorithms for processing probabilistic and determin...
research
07/04/2012

Modeling Transportation Routines using Hybrid Dynamic Mixed Networks

This paper describes a general framework called Hybrid Dynamic Mixed Net...

Please sign up or login with your details

Forgot password? Click here to reset