Axioms and Algorithms for Inferences Involving Probabilistic Independence
Axioms and Algorithms for Inferences Involving Probabilistic Independence
D. Geiger,A. Paz,J. Pearl
1991 · DOI: 10.1016/0890-5401(91)90077-F
Information and Computation · 109 Citations
TLDR
An axiomatic characterization of the probabilistic relation “X is independent of Y (written (X, Y)”, where X and Y are two disjoint sets of variables, and a polynomial membership algorithm is developed to decide whether any given independence statement (X) logically follows from a set of such statements.
