Exploiting independencies to compute semigraphoid and graphoid structures
From MaRDI portal
Publication:541838
DOI10.1016/j.ijar.2010.11.001zbMath1216.62006OpenAlexW2031507154MaRDI QIDQ541838
Giuseppe Busanello, Marco Baioletti, Barbara Vantaggi
Publication date: 8 June 2011
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2010.11.001
Applications of graph theory (05C90) Foundations and philosophical topics in statistics (62A01) Axioms; other general questions in probability (60A05)
Related Items
DAG representation of asymmetric independence models arising in coherent conditional possibility theory ⋮ Asymmetric decomposability and persegram representation in coherent conditional probability theory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conditional independence structure and its closure: inferential rules and algorithms
- Racing algorithms for conditional independence inference
- Axioms and algorithms for inferences involving probabilistic independence
- Logical and algorithmic properties of conditional independence and graphical models
- Stochastic independence, algebraic independence and abstract connectedness
- Conditional independence and natural conditional functions
- Semigraphoids and structures of probabilistic conditional independence
- Stochastic independence in a coherent setting
- On stochastic conditional independence: The problems of characterization and description
- The L-separation criterion for description of cs-independence models
- Conditional independence in a coherent finite setting
- Separoids: a mathematical framework for conditional independence and irrelevance
- The role of coherence for handling probabilistic evaluations and independence
- Acyclic Directed Graphs to Represent Conditional Independence Models