Approximate Implication with d-Separation

The graphical structure of Probabilistic Graphical The implication problem is the task of determining whether Models (PGMs) encodes the conditional independence a set of CIs termed antecedents logically entail another (CI) relations that hold in the modeled distribution. CI, called the consequent, and it has received considerable Graph algorithms, such as d-separation, attention from both the AI and Database communities use this structure to infer additional conditional [10, 12, 15, 16, 22, 23]. Known algorithms for deriving independencies, and to query whether a specific CIs from the topological structure of the graphical model CI holds in the distribution. The premise of all are, in fact, an instance of implication. Notably, the DAG current systems-of-inference for deriving CIs in structure of Bayesian Networks is generated based on a set PGMs, is that the set of CIs used for the construction of CIs termed the recursive basis [11], and the d-separation of the PGM hold exactly. In practice, algorithms algorithm is used to derive additional CIs, implied by this for extracting the structure of PGMs from set. The d-separation algorithm is a sound and complete data, discover approximate CIs that do not hold exactly method for deriving CIs in probability distributions represented in the distribution. In this paper, we ask how by DAGs [10, 11], and hence completely characterizes the error in this set propagates to the inferred CIs the CIs that hold in the distribution.