Testing Implication of Probabilistic Dependencies
Abstract
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.
Cite
Text
Wong. "Testing Implication of Probabilistic Dependencies." Conference on Uncertainty in Artificial Intelligence, 1996.Markdown
[Wong. "Testing Implication of Probabilistic Dependencies." Conference on Uncertainty in Artificial Intelligence, 1996.](https://mlanthology.org/uai/1996/wong1996uai-testing/)BibTeX
@inproceedings{wong1996uai-testing,
title = {{Testing Implication of Probabilistic Dependencies}},
author = {Wong, S. K. Michael},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {1996},
pages = {545-553},
url = {https://mlanthology.org/uai/1996/wong1996uai-testing/}
}