Uncertainty in Artificial Intelligence
First Name   Last Name   Password   Forgot Password   Log in!
    Proceedings   Proceeding details   Article details         Authors         Search    
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.
Pages: 352-359
PS Link:
PDF Link: /papers/88/p352-verma.pdf
AUTHOR = "Tom Verma and Judea Pearl",
TITLE = "Causal Networks: Semantics and Expressiveness",
BOOKTITLE = "Proceedings of the Fourth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-88)",
ADDRESS = "Corvallis, Oregon",
YEAR = "1988",
PAGES = "352--359"

hosted by DSL   •   site info   •   help