Bayesian inference by symbolic model checking
From MaRDI portal
Publication:2056985
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Probabilistic graphical models (62H22) Reasoning under uncertainty in the context of artificial intelligence (68T37) Specification and verification (program logics, model checking, etc.) (68Q60)
Abstract: This paper applies probabilistic model checking techniques for discrete Markov chains to inference in Bayesian networks. We present a simple translation from Bayesian networks into tree-like Markov chains such that inference can be reduced to computing reachability probabilities. Using a prototypical implementation on top of the Storm model checker, we show that symbolic data structures such as multi-terminal BDDs (MTBDDs) are very effective to perform inference on large Bayesian network benchmarks. We compare our result to inference using probabilistic sentential decision diagrams and vtrees, a scalable symbolic technique in AI inference tools.
Recommendations
- Probabilistic Model Checking for Continuous-Time Markov Chains via Sequential Bayesian Inference
- Symbolic model checking for factored probabilistic models
- Modeling and Reasoning with Bayesian Networks
- Model checking finite-horizon Markov chains with probabilistic inference
- scientific article; zbMATH DE number 2096817
Cited in
(13)- Exact Bayesian inference by symbolic disintegration
- Model checking finite-horizon Markov chains with probabilistic inference
- Automatically finding the right probabilities in Bayesian networks
- Gradient-descent for randomized controllers under partial observability
- Reachability design through approximate Bayesian computation
- Probabilistic Model Checking for Continuous-Time Markov Chains via Sequential Bayesian Inference
- Bayesian statistical model checking with application to Stateflow/Simulink verification
- How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times
- Dynamic Bayesian networks for formal verification of structured stochastic processes
- Computational Science – ICCS 2005
- Symbolic model checking for factored probabilistic models
- State-space abstractions for probabilistic inference: a systematic review
- Fine-tuning the odds in Bayesian networks
This page was built for publication: Bayesian inference by symbolic model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056985)
