A generic framework for a compilation-based inference in probabilistic and possibilistic networks
From MaRDI portal
Publication:498039
DOI10.1016/J.INS.2013.04.019zbMATH Open1320.68177OpenAlexW1975697086MaRDI QIDQ498039FDOQ498039
Authors: Raouia Ayachi, Nahla Ben Amor, Salem Benferhat 
Publication date: 25 September 2015
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2013.04.019
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
- Modeling and Reasoning with Bayesian Networks
- Title not available (Why is that?)
- Conditional possibilities independence and noninteraction
- Title not available (Why is that?)
- Decomposable negation normal form
- Fusion, propagation, and structuring in belief networks
- Top-down algorithms for constructing structured DNNF: theoretical and practical implications
- Title not available (Why is that?)
- Reasoning in evidential networks with conditional belief functions
- Logical Compilation of Bayesian Networks with Discrete Variables
- A randomized approximation algorithm for probabilistic inference on bayesian belief networks
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)
