Testing Implication of Probabilistic Dependencies
This work addresses a foundational issue in probabilistic reasoning for researchers, though it appears incremental as it adapts an existing chase technique to a new context.
The paper tackles the problem of testing logical implications of probabilistic dependencies by proposing a non-axiomatic method called the chase, which can require exponential time but offers theoretical insights and connects relational databases with probabilistic reasoning.
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.