A generic framework for a compilation-based inference in probabilistic and possibilistic networks

DOI10.1016/J.INS.2013.04.019zbMath1320.68177OpenAlexW1975697086MaRDI QIDQ498039

Salem Benferhat, Nahla Ben Amor, Raouia Ayachi

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

zbMATH Keywords

Bayesian networkpossibilistic networkcompilation-based inference

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (1)

Evaluating Product-Based Possibilistic Networks Learning Algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fusion, propagation, and structuring in belief networks
• Conditional possibilities independence and noninteraction
• Reasoning in evidential networks with conditional belief functions
• Top-Down Algorithms for Constructing Structured DNNF: Theoretical and Practical Implications
• Logical Compilation of Bayesian Networks with Discrete Variables
• Modeling and Reasoning with Bayesian Networks
• Decomposable negation normal form
• A randomized approximation algorithm for probabilistic inference on bayesian belief networks

This page was built for publication: A generic framework for a compilation-based inference in probabilistic and possibilistic networks