Testing Implication of Probabilistic Dependencies

Axiomatization has been widely used for testing logical implications. This paper suggests a non-axiomatic method, the chase, to test if a new dependency follows from a given set of probabilistic dependencies. Although the chase computation may require exponential time in some cases, this technique is a powerful tool for establishing nontrivial theoretical results. More importantly, this approach provides valuable insight into the intriguing connection between relational databases and probabilistic reasoning systems.

[1]  Catriel Beeri,et al.  A complete axiomatization for functional and multivalued dependencies in database relations , 1977, SIGMOD '77.

[2]  Ronald Fagin,et al.  A simplied universal relation assumption and its properties , 1982, TODS.

[3]  Gregory F. Cooper,et al.  The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks , 1990, Artif. Intell..

[4]  Ronald Fagin,et al.  Multivalued dependencies and a new normal form for relational databases , 1977, TODS.

[5]  Yang Xiang,et al.  Representation of Bayesian Networks as Relational Databases , 1994, IPMU.

[6]  Yehoshua Sagiv,et al.  Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies , 1982, JACM.

[7]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[8]  Yang Xiang,et al.  A Method for Implementing a Probabilistic Model as a Relational Database , 1995, UAI.

[9]  Petr Hájek,et al.  Uncertain information processing in expert systems , 1992 .

[10]  David Maier,et al.  The Theory of Relational Databases , 1983 .

[11]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems , 1988 .

[12]  Richard E. Neapolitan,et al.  Probabilistic reasoning in expert systems - theory and algorithms , 2012 .

[13]  S. K. Michael Wong,et al.  On Axiomatization of Probabilistic Conditional Independencies , 1994, UAI.

[14]  Claude Delobel,et al.  Normalization and hierarchical dependencies in the relational data model , 1978, TODS.

[15]  Judea Pearl,et al.  Fusion, Propagation, and Structuring in Belief Networks , 1986, Artif. Intell..

[16]  Catriel Beeri,et al.  On the Desirability of Acyclic Database Schemes , 1983, JACM.

[17]  Judea Pearl,et al.  GRAPHOIDS: A Graph-based logic for reasoning about relevance relations , 1985 .

[18]  A. Bonato,et al.  Graphs and Hypergraphs , 2022 .

[19]  Alfred V. Aho,et al.  Efficient optimization of a class of relational expressions , 1978, SIGMOD Conference.