Causal Networks: Semantics and Expressiveness
Tom Verma, Judea Pearl
Dependency knowledge of the form "x is independent of y once z is known" invariably obeys the four graphoid axioms, examples include probabilistic and database dependencies. Often, such knowledge can be represented efficiently with graphical structures such as undirected graphs and directed acyclic graphs (DAGs). In this paper we show that the graphical criterion called d-separation is a sound rule for reading independencies from any DAG based on a causal input list drawn from a graphoid. The rule may be extended to cover DAGs that represent functional dependencies as well as conditional dependencies.
PDF Link: /papers/88/
AUTHOR = "Tom Verma
and Judea Pearl",
TITLE = "Causal Networks: Semantics and Expressiveness",
BOOKTITLE = "Uncertainty in Artificial Intelligence 4 Annual Conference on Uncertainty in Artificial Intelligence (UAI-88)",
PUBLISHER = "Elsevier Science",
ADDRESS = "Amsterdam, NL",
YEAR = "1988",
PAGES = "69--76"