Possibilistic local structure for compiling min-based networks

DOI10.1007/978-3-642-33042-1_51zbMATH Open1336.68248OpenAlexW9674834MaRDI QIDQ2805818FDOQ2805818

Authors: Raouia Ayachi, Nahla Ben Amor, Salem Benferhat 

Publication date: 13 May 2016

Published in: Synergies of Soft Computing and Statistics for Intelligent Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33042-1_51

Recommendations

• Compiling min-based possibilistic causal networks: a mutilated-based approach
• Inference using compiled product-based possibilistic networks
• A generic framework for a compilation-based inference in probabilistic and possibilistic networks
• Inference using compiled min-based possibilistic causal networks in the presence of interventions
• scientific article; zbMATH DE number 1844476

zbMATH Keywords

inferencecompilationpossibilistic reasoning

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Conditional possibilities independence and noninteraction
• Title not available (Why is that?)
• Decomposable negation normal form

Cited In (4)

• Inference using compiled product-based possibilistic networks
• Inference using compiled min-based possibilistic causal networks in the presence of interventions
• Compiling min-based possibilistic causal networks: a mutilated-based approach
• Compiling probabilistic graphical models using sentential decision diagrams

This page was built for publication: Possibilistic local structure for compiling min-based networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805818)