Abstract
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.
This research is supported by the Marsden Fund Council from Government funding, administered by the Royal Society of New Zealand.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beeri, C., Fagin, R., Howard, J.H.: A complete axiomatization for functional and multivalued dependencies in database relations. In: Smith, D. (ed.) SIGMOD Conference, pp. 47–61. ACM (1977)
Biskup, J.: Inferences of multivalued dependencies in fixed and undetermined universes. Theor. Comput. Sci. 10(1), 93–106 (1980)
Biskup, J., Link, S.: Appropriate inferences of data dependencies in relational databases. Ann. Math. Artif. Intell. 63(3-4), 213–255 (2012)
Biskup, J.: Foundations of Information Systems. Vieweg, Wiesbaden (1995) (in German)
Fagin, R.: Multivalued dependencies and a new normal form for relational databases. ACM Trans. Database Syst. 2(3), 262–278 (1977)
Galil, Z.: An almost linear-time algorithm for computing a dependency basis in a relational database. J. ACM 29(1), 96–102 (1982)
Geiger, D., Pearl, J.: Logical and algorithmic properties of conditional independence and graphical models. The Annals of Statistics 21(4), 2001–2021 (1993)
Halpern, J.: Reasoning about uncertainty. MIT Press, Cambridge (2005)
Hartmann, S., Link, S.: The implication problem of data dependencies over SQL table definitions. ACM Trans. Datab. Syst. 37(2), Article 13 (May 2012)
Link, S.: Charting the completeness frontier of inference systems for multivalued dependencies. Acta Inf. 45(7-8), 565–591 (2008)
Malvestuto, F.: A unique formal system for binary decompositions of database relations, probability distributions, and graphs. Inf. Sci. 59(1-2), 21–52 (1992)
Niepert, M., Van Gucht, D., Gyssens, M.: Logical and algorithmic properties of stable conditional independence. Int. J. Approx. Reasoning 51(5), 531–543 (2010)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco (1988)
Studený, M.: Conditional independence relations have no finite complete characterization. In: Kubik, S., Visek, J. (eds.) Transactions of the 11th Prague Conference on Information Theory, pp. 377–396. Kluwer (1992)
Wong, S., Butz, C., Wu, D.: On the implication problem for probabilistic conditional independency. IEEE Transactions on Systems, Man, and Cybernetics, Part A 30(6), 785–805 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Biskup, J., Hartmann, S., Link, S. (2012). Probabilistic Conditional Independence under Schema Certainty and Uncertainty. In: Hüllermeier, E., Link, S., Fober, T., Seeger, B. (eds) Scalable Uncertainty Management. SUM 2012. Lecture Notes in Computer Science(), vol 7520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33362-0_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-33362-0_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33361-3
Online ISBN: 978-3-642-33362-0
eBook Packages: Computer ScienceComputer Science (R0)