Deciding morality of graphs is NP-complete

Authors:
T. S. Verma;J. Pearl
Affiliations:
Cognative Systems Laboratory, Computer Science Department, UCLA, Los Angles, CA;Cognative Systems Laboratory, Computer Science Department, UCLA, Los Angles, CA
Venue:
UAI'93 Proceedings of the Ninth international conference on Uncertainty in artificial intelligence
Year:
1993

Citing 4
Cited 0

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
An algorithm for deciding if a set of observed independencies has a causal explanation

UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
Causal networks: semantics and expressiveness

UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
Equivalence and synthesis of causal models

UAI '90 Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to find a causal explanation for data presented in the form of covariance and concentration matrices it is necessary to decide if the graph formed by such associations is a projection of a directed acyclic graph (dag). We show that the general problem of deciding whether such a dag exists is NP-complete.