GRAPHOID PROPERTIES OF QUALITATIVE POSSIBILISTIC INDEPENDENCE RELATIONS
From MaRDI portal
Publication:4678438
DOI10.1142/S021848850500331XzbMath1096.68147OpenAlexW2044274057MaRDI 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)
Full work available at URL: https://doi.org/10.1142/s021848850500331x
Related Items (7)
DAG representation of asymmetric independence models arising in coherent conditional possibility theory ⋮ Hybrid possibilistic networks ⋮ Acyclic directed graphs representing independence models ⋮ Conditional independence structure and its closure: inferential rules and algorithms ⋮ Algorithms for possibility assessments: coherence and extension ⋮ Inferring interventions in product-based possibilistic causal networks ⋮ 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
This page was built for publication: GRAPHOID PROPERTIES OF QUALITATIVE POSSIBILISTIC INDEPENDENCE RELATIONS
