Article ID Journal Published Year Pages File Type
398147 International Journal of Approximate Reasoning 2009 18 Pages PDF
Abstract

In this paper, we deal with conditional independence models closed with respect to graphoid properties. Such models come from different uncertainty measures, in particular in a probabilistic setting. We study some inferential rules and describe methods and algorithms to compute efficiently the closure of a set of conditional independence statements.

Related Topics
Physical Sciences and Engineering Computer Science Artificial Intelligence