A generic framework for a compilation-based inference in probabilistic and possibilistic networks
From MaRDI portal
(Redirected from Publication:498039)
Recommendations
- Inference using compiled product-based possibilistic networks
- Inference in qualitative probabilistic networks revisited
- \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
- Compiling relational Bayesian networks for exact inference
- Probabilistic Logic Networks
- Probabilistic inference in credal networks: new complexity results
Cites work
- scientific article; zbMATH DE number 1665314 (Why is no real title available?)
- scientific article; zbMATH DE number 193123 (Why is no real title available?)
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- A randomized approximation algorithm for probabilistic inference on bayesian belief networks
- Conditional possibilities independence and noninteraction
- Decomposable negation normal form
- Fusion, propagation, and structuring in belief networks
- Logical Compilation of Bayesian Networks with Discrete Variables
- Modeling and Reasoning with Bayesian Networks
- Reasoning in evidential networks with conditional belief functions
- Top-down algorithms for constructing structured DNNF: theoretical and practical implications
Cited in
(3)
This page was built for publication: A generic framework for a compilation-based inference in probabilistic and possibilistic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q498039)