GRAPHOID PROPERTIES OF QUALITATIVE POSSIBILISTIC INDEPENDENCE RELATIONS

DOI10.1142/S021848850500331XzbMath1096.68147MaRDI QIDQ4678438

Salem Benferhat, Nahla Ben Amor

Publication date: 23 May 2005

Published in: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)

zbMATH Keywords

Bayesian networks; plausibility relations

Mathematics Subject Classification ID

68T37: Reasoning under uncertainty in the context of artificial intelligence

Related Items

DAG representation of asymmetric independence models arising in coherent conditional possibility theory, Algorithms for possibility assessments: coherence and extension, Inferring interventions in product-based possibilistic causal networks, Acyclic directed graphs representing independence models, Hybrid possibilistic networks, Conditional independence structure and its closure: inferential rules and algorithms, Possibility theory: conditional independence

Cites Work

• Unnamed Item
• Unnamed Item
• Conditional possibilities independence and noninteraction
• The concept of a linguistic variable and its application to approximate reasoning. III
• Independence concepts in possibility theory. I
• Independence concepts in possibility theory: II
• Semigraphoids and structures of probabilistic conditional independence
• Independence and possibilistic conditioning
• A comparative study of possibilistic conditional independence and lack of interaction
• Conditional independence in a coherent finite setting
• POSSIBILITY THEORY II: CONDITIONAL POSSIBILITY
• POSSIBILITY THEORY III: POSSIBILISTIC INDEPENDENCE
• CONDITIONAL INDEPENDENCE RELATIONS IN POSSIBILITY THEORY
• A THEORETICAL FRAMEWORK FOR POSSIBILISTIC INDEPENDENCE IN A WEAKLY ORDERED SETTING
• Upper and Lower Probabilities Induced by a Multivalued Mapping