Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies
Journal of the ACM (JACM)
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Inferences involving embedded multivalued dependencies and transitive dependencies
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
Representation of Bayesian Networks as Relational Databases
IPMU'94 Selected papers from the 5th International Conference on Processing and Management of Uncertainty in Knowledge-Based Systems, Advances in Intelligent Computing
Theory of Relational Databases
Theory of Relational Databases
Hi-index | 0.00 |
This paper studies the connection between probabilistic conditional independence in uncertain reasoning and data dependency in relational databases. As a demonstration of the usefulness of this preliminary investigation, an alternate proof is presented for refuting the conjecture suggested by Pearl and Paz that probabilistic conditional independencies have a complete axiomatization.