The membership problem for probabilistic and data dependencies

Authors:
S. K. M. Wong;C. J. Butz
Affiliations:
Department of Computer Science, University of Regina, Regina, Canada;School of Information Technology & Engineering, University of Ottawa, Ottawa, Canada
Venue:
Technologies for constructing intelligent systems
Year:
2002

Citing 11
Cited 0

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
An Extended Relational Data Model For Probabilistic Reasoning

Journal of Intelligent Information Systems
On Axiomatizing Multivalued Dependencies in Relational Databases

Journal of the ACM (JACM)
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)
A complete axiomatization for functional and multivalued dependencies in database relations

SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Inferences involving embedded multivalued dependencies and transitive dependencies

SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
Theory of Relational Databases

Theory of Relational Databases
A method for implementing a probabilistic model as a relational database

UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Testing implication of probabilistic dependencies

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
On the implication problem for probabilistic conditional independency

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	0.00

Visualization

Abstract

It has been suggested that Bayesian networks and relational databases are different because the membership problems for probabilistic conditional independence and embedded multivalued dependency do not always coincide. The present study indicates that the membership problems coincide on solvable classes of dependencies and differ on unsolvable classes. We therefore maintain that Bayesian networks and relational databases are the same in a practical sense, since only solvable classes of dependencies are useful in the design and implementation of both knowledge systems.