Semigraphoids and structures of probabilistic conditional independence

DOI10.1023/A:1018905100242MaRDI QIDQ1370588zbMATH OpenOpenAlexFDO

Authors Milan Studený

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

zbMATH Keywords

conditional independence

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Recommendations

• STRUCTURAL SEMIGRAPHOIDS¹
• Exploiting independencies to compute semigraphoid and graphoid structures
• Conditional independence structure and its closure: inferential rules and algorithms
• On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements

Cited in

(30)

• Computing lower and upper expectations under epistemic independence
• Concise representations and construction algorithms for semi-graphoid independency models
• DAG representation of asymmetric independence models arising in coherent conditional possibility theory
• scientific article; zbMATH DE number 2088048 (Why is no real title available?)
• Towards classification of semigraphoids.
• Lengths of semigraphoid inferences
• GRAPHOID PROPERTIES OF QUALITATIVE POSSIBILISTIC INDEPENDENCE RELATIONS
• Semigroup Structure of Singleton Dempster–Shafer Evidence Accumulation
• Graphoid properties of concepts of independence for sets of probabilities
• Exploiting independencies to compute semigraphoid and graphoid structures
• On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements
• Acyclic directed graphs representing independence models
• Separoids: a mathematical framework for conditional independence and irrelevance
• Graphoid properties of epistemic irrelevance and independence
• Conditional independence structure and its closure: inferential rules and algorithms
• An algorithm to find a perfect map for graphoid structures
• Conditional independence structures examined via minors
• Contribution of František Matúš to the research on conditional independence.
• The L-separation criterion for description of cs-independence models
• Asymmetric decomposability and persegram representation in coherent conditional probability theory
• Finding P-maps and I-maps to represent conditional independencies
• Epistemic irrelevance on sets of desirable gambles
• STRUCTURAL SEMIGRAPHOIDS¹
• Computing concise representations of semi-graphoid independency models
• Algebraic aspects of Bayesian modeling in psychology
• Acyclic Directed Graphs to Represent Conditional Independence Models
• Representing independence models with elementary triplets
• A computational algebraic-geometry method for conditional-independence inference
• A lattice-based representation of independence relations for efficient closure computation
• Kuznetsov independence for interval-valued expectations and sets of probability distributions: properties and algorithms

This page was built for publication: Semigraphoids and structures of probabilistic conditional independence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1370588)