Lengths of semigraphoid inferences

DOI10.1023/A:1014525817725zbMath0991.05039OpenAlexW1536089864MaRDI QIDQ1601911

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-coloringregular graphsgraphoidssemigraphoidsinference length

Mathematics Subject Classification ID

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

Related Items (4)

A computational algebraic-geometry method for conditional-independence inference ⋮ Representing independence models with elementary triplets ⋮ Towards classification of semigraphoids. ⋮ Contribution of Frantisek Matus to the research on conditional independence

This page was built for publication: Lengths of semigraphoid inferences