A unique formal system for binary decompositions of database relations, probability distributions, and graphs
From MaRDI portal
Publication:1177386
DOI10.1016/0020-0255(92)90042-7zbMath0764.68030OpenAlexW4253951539MaRDI QIDQ1177386
Publication date: 26 June 1992
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(92)90042-7
Related Items (8)
A complete axiomatization of full acyclic join dependencies ⋮ Stochastic independence, algebraic independence and abstract connectedness ⋮ Fuzzy functional dependencies and Bayesian networks ⋮ Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty ⋮ Comment on A unique formal system for binary decompositions of database relations, probability distributions, and graphs ⋮ On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements ⋮ Contribution of Frantisek Matus to the research on conditional independence ⋮ Characterisation of conditional independence structures for polymatroids using vanishing sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Existence of extensions and product extensions for discrete probability distributions
- Conditional independence for statistical operations
- Markov fields and log-linear interaction models for contingency tables
- Statistical treatment of the information content of a database
- Information Theory and Statistical Mechanics
- Decompositions and functional dependencies in relations
- Réductions de graphes et systèmes de Church-Rosser
- On Decomposition Theory: Generalized Dependence
- On decomposition theory: Duality
- Approximating discrete probability distributions with dependence trees
- Approximating discrete probability distributions
This page was built for publication: A unique formal system for binary decompositions of database relations, probability distributions, and graphs
