Finding P-Maps and I-Maps to Represent Conditional Independencies

摘要

The representation problem of independence models is studied by focusing on acyclic directed graph (DAG). We present the algorithm PC. in order to look for a perfect map. However, when a perfect map does not exist, so that PC* fails, it is interesting to find a minimal I-map, which represents as many triples as possible in J*. Therefore we describe an algorithm which finds such a map by means of a backtracking procedure.