Exploiting Unconditional Independencies in SemiGraphoid Closure Computation

Abstract

We deal with the problem of computing efficiently the closure with respect to semigraphoid and graphoid properties of a given set of independencies compatible with a (coherent) probability. In particular, we improve the procedure by using properly unconditional independence statements. 

Topics

Cite this paper

@inproceedings{Baioletti2009ExploitingUI, title={Exploiting Unconditional Independencies in SemiGraphoid Closure Computation}, author={Marco Baioletti and Giuseppe Busanello and Barbara Vantaggi}, year={2009} }