Information Sciences: an International Journal
A complete axiomatization of full acyclic join dependencies
Information Processing Letters
A Complete Axiomatization of Full Join Dependencies
Journal of the ACM (JACM)
A hypergraph-theoretic analysis of collapsibility and decomposability for extended log-linear models
Statistics and Computing
Statistical versus Relational Join Dependencies
Proceedings of the Seventh International Working Conference on Scientific and Statistical Database Management
Theory of Relational Databases
Theory of Relational Databases
On the implication problem for probabilistic conditional independency
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Hi-index | 0.00 |
Factorization constraints are introduced as a generalization of the multiplicative formulation of conditional independence, and some computational and logic properties are stated. More precisely, we prove that factorization constraints characterize those cases in which a probability distribution can be represented “without loss of information” by a suitable set of its marginals. Moreover, we provide a sound formal system for factorization constraints, which covers the set of the so-called semi-graphoid axioms of conditional independence. Finally, we solve the implication problem for factorization constraints in two special cases, and for the general case we state two conditions, one necessary and the other sufficient for an implication to hold.