Lengths of semigraphoid inferences

DOI10.1023/A:1014525817725MaRDI QIDQ1601911zbMATH OpenOpenAlexFDO

Authors František Matúš

Publication date 27 June 2002

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1014525817725

zbMATH Keywords

edge-coloringgraphoidsinference lengthregular graphssemigraphoids

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Relational systems, laws of composition (08A02)

Recommendations

• Towards classification of semigraphoids.
• Semigraphoids and structures of probabilistic conditional independence
• STRUCTURAL SEMIGRAPHOIDS¹
• Three Counter-Examples on Semi-Graphoids
• Exploiting independencies to compute semigraphoid and graphoid structures

Cited in

(5)

• Towards classification of semigraphoids.
• Representing independence models with elementary triplets
• A computational algebraic-geometry method for conditional-independence inference
• Contribution of František Matúš to the research on conditional independence.
• Self-adhesivity in lattices of abstract conditional independence models

This page was built for publication: Lengths of semigraphoid inferences

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