Probabilistic Conditional Independence under Schema Certainty and Uncertainty

Conditional independence provides an essential framework to deal with knowledge and uncertainty in Artificial Intelligence, and is fundamental in probability and multivariate statistics. Its associated implication problem is paramount for building Bayesian networks. Saturated conditional independencies form an important subclass of conditional independencies. Under schema certainty, the implication problem of this subclass is finitely axiomatizable and decidable in almost linear time. We study the implication problem of saturated conditional independencies under both schema certainty and uncertainty. Under schema certainty, we establish a finite axiomatization with the following property: every independency whose implication is dependent on the underlying schema can be inferred by a single application of the so-called symmetry rule to some independency whose implication is independent from the underlying schema. Removing the symmetry rule from the axiomatization under schema certainty results in an axiomatization for a notion of implication that leaves the underlying schema undetermined. Hence, the symmetry rule is just a means to infer saturated conditional independencies whose implication is truly dependent on the schema.

[1]  Marc Gyssens,et al.  Logical and algorithmic properties of stable conditional independence , 2010, Int. J. Approx. Reason..

[2]  Milan Studeny,et al.  Conditional independence relations have no finite complete characterization , 1992 .

[3]  Francesco M. Malvestuto,et al.  Comment on "A unique formal system for binary decompositions of database relations, probability distributions, and graphs" , 1992, Inf. Sci..

[4]  Ronald Fagin,et al.  Multivalued dependencies and a new normal form for relational databases , 1977, TODS.

[5]  Joseph Y. Halpern Reasoning about uncertainty , 2003 .

[6]  Sven Hartmann,et al.  The implication problem of data dependencies over SQL table definitions: Axiomatic, algorithmic and logical characterizations , 2012, TODS.

[7]  Joachim Biskup Inferences of Multivalued Dependencies in Fixed and Undetermined Universes , 1980, Theor. Comput. Sci..

[8]  Catriel Beeri,et al.  A complete axiomatization for functional and multivalued dependencies in database relations , 1977, SIGMOD '77.

[9]  J. Pearl,et al.  Logical and Algorithmic Properties of Conditional Independence and Graphical Models , 1993 .

[10]  S. Sullivant Gaussian conditional independence relations have no finite complete characterization , 2007, 0704.2847.

[11]  Sebastian Link,et al.  Appropriate inferences of data dependencies in relational databases , 2012, Annals of Mathematics and Artificial Intelligence.

[12]  Francesco M. Malvestuto A unique formal system for binary decompositions of database relations, probability distributions, and graphs , 1992, Inf. Sci..

[13]  Sebastian Link Charting the completeness frontier of inference systems for multivalued dependencies , 2008, Acta Informatica.

[14]  Dan Wu,et al.  On the implication problem for probabilistic conditional independency , 2000, IEEE Trans. Syst. Man Cybern. Part A.

[15]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[16]  Zvi Galil,et al.  An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database , 1982, JACM.

[17]  Vladimir Zwass,et al.  Foundations of information systems , 1997 .