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.
Keywords: Probabilistic conditional independence, axiomatization,
extended relational data mod
PS Link: http://cs.uregina.ca/~wong/papers/depend.ps
PDF Link: /papers/96/p545-wong.pdf
AUTHOR = "Michael Wong
TITLE = "Testing Implication of Probabilistic Dependencies",
BOOKTITLE = "Proceedings of the Twelfth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-96)",
PUBLISHER = "Morgan Kaufmann",
ADDRESS = "San Francisco, CA",
YEAR = "1996",
PAGES = "545--553"