mlsanityData to 7 Oct 2026

An Algorithm for Deciding if a Set of Observed Independencies Has a Causal Explanation

arXiv 1303.5435 ↗First posted 13 Mar 2013cs.AIcited by 17

Not on the map. Why?

Abstract (arXiv)

In a previous paper [Pearl and Verma, 1991] we presented an algorithm for extracting causal influences from independence information, where a causal influence was defined as the existence of a directed arc in all minimal causal models consistent with the data. In this paper we address the question of deciding whether there exists a causal model that explains ALL the observed dependencies and independencies. Formally, given a list M of conditional independence statements, it is required to decide whether there exists a directed acyclic graph (dag) D that is perfectly consistent with M, namely, every statement in M, and no other, is reflected via dseparation in D. We present and analyze an effective algorithm that tests for the existence of such a day, and produces one, if it exists.

Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). First posted on arXiv 13 Mar 2013.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 2; 2023: 3; 2024: 6; 2025: 1; 2026: 1.

17 papers.

Sort: