Compiling min-based possibilistic causal networks: a mutilated-based approach
From MaRDI portal
Recommendations
- Inference using compiled min-based possibilistic causal networks in the presence of interventions
- Possibilistic local structure for compiling min-based networks
- Inference using compiled product-based possibilistic networks
- Min-based causal possibilistic networks: handling interventions and analyzing the possibilistic counterpart of Jeffrey's rule of conditioning
- scientific article; zbMATH DE number 1844476
Cites work
- Decomposable negation normal form
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- scientific article; zbMATH DE number 1493045 (Why is no real title available?)
- Modeling and Reasoning with Bayesian Networks
- On the transformation between possibilistic logic bases and possibilistic causal networks
- Possibilistic logic: Complexity and algorithms
Cited in
(8)- A prallel algorithm for building possibilistic causal networks
- Possibilistic causality consistency problem based on asymmetrically-valued causal model
- Inference using compiled min-based possibilistic causal networks in the presence of interventions
- Possibilistic local structure for compiling min-based networks
- Min-based causal possibilistic networks: handling interventions and analyzing the possibilistic counterpart of Jeffrey's rule of conditioning
- Inference using compiled product-based possibilistic networks
- Quantitative possibility theory: logical- and graphical-based representations
- scientific article; zbMATH DE number 1844476 (Why is no real title available?)
This page was built for publication: Compiling min-based possibilistic causal networks: a mutilated-based approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3011984)
