Semigraphoids and structures of probabilistic conditional independence
From MaRDI portal
Publication:1370588
DOI10.1023/A:1018905100242zbMath0888.68112OpenAlexW2131553237MaRDI QIDQ1370588
Publication date: 1 June 1998
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018905100242
Related Items
Graphoid properties of epistemic irrelevance and independence ⋮ Epistemic irrelevance on sets of desirable gambles ⋮ DAG representation of asymmetric independence models arising in coherent conditional possibility theory ⋮ An Algorithm to Find a Perfect Map for Graphoid Structures ⋮ Concise representations and construction algorithms for semi-graphoid independency models ⋮ Computing Concise Representations of Semi-graphoid Independency Models ⋮ A computational algebraic-geometry method for conditional-independence inference ⋮ Algebraic aspects of Bayesian modeling in psychology ⋮ Computing lower and upper expectations under epistemic independence ⋮ Acyclic directed graphs representing independence models ⋮ A lattice-based representation of independence relations for efficient closure computation ⋮ Towards classification of semigraphoids. ⋮ Finding P–Maps and I–Maps to Represent Conditional Independencies ⋮ Conditional independence structure and its closure: inferential rules and algorithms ⋮ Exploiting independencies to compute semigraphoid and graphoid structures ⋮ GRAPHOID PROPERTIES OF QUALITATIVE POSSIBILISTIC INDEPENDENCE RELATIONS ⋮ Acyclic Directed Graphs to Represent Conditional Independence Models ⋮ Contribution of Frantisek Matus to the research on conditional independence ⋮ The L-separation criterion for description of cs-independence models ⋮ Kuznetsov independence for interval-valued expectations and sets of probability distributions: properties and algorithms ⋮ Asymmetric decomposability and persegram representation in coherent conditional probability theory
