AIFeb 27, 2013

On Axiomatization of Probabilistic Conditional Independencies

arXiv:1302.6853v113 citations
Originality Synthesis-oriented
AI Analysis

This work addresses a foundational issue in AI and databases for researchers, but it is incremental as it builds on prior conjectures and proofs.

The paper tackled the problem of connecting probabilistic conditional independence in uncertain reasoning with data dependency in relational databases, and as a result, provided an alternate proof refuting the conjecture that probabilistic conditional independencies have a complete axiomatization.

This paper studies the connection between probabilistic conditional independence in uncertain reasoning and data dependency in relational databases. As a demonstration of the usefulness of this preliminary investigation, an alternate proof is presented for refuting the conjecture suggested by Pearl and Paz that probabilistic conditional independencies have a complete axiomatization.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes