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. Unfortunately, the problem does not enjoy a finite ground axiomatization and is already coNP-complete to decide for restricted subclasses. Saturated conditional independencies form an important subclass of conditional independencies whose implication problem is decidable in almost linear time. Geiger and Pearl have established a finite ground axiomatization for this class. We establish a new completeness proof for this axiomatization, utilizing a new sound inference rule. The proof introduces special probability models where two values have probability one half. Special probability models allow us to establish a semantic proof for the equivalence between the implication of saturated conditional independencies and formulae in a Boolean propositional fragment. The equivalence extends the duality between the propositional fragment and multivalued dependencies in relational databases to a trinity involving saturated conditional independencies.
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., Link, S.: Appropriate inferences of data dependencies in relational databases. Ann. Math. Artif. Intell. 63(3-4), 213–255 (2012)
Enderton, H.: A Mathematical Introduction to Logic. Academic Press (2001)
Fagin, R.: Functional dependencies in a relational data base and propositional logic. IBM Journal of Research and Development 21(6), 543–544 (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 (2005)
Hartmann, S., Link, S.: The implication problem of data dependencies over SQL table definitions: Axiomatic, algorithmic and logic characterizations. ACM Trans. Datab. Syst. 13, Article 13 (May 2012)
Hartmann, S., Link, S.: On a problem of Fagin concerning multivalued dependencies in relational databases. Theor. Comput. Sci. 353(1-3), 53–62 (2006)
Hartmann, S., Link, S.: Characterising nested database dependencies by fragments of propositional logic. Ann. Pure Appl. Logic 152(1-3), 84–106 (2008)
Link, S.: Charting the completeness frontier of inference systems for multivalued dependencies. Acta Inf. 45(7-8), 565–591 (2008)
Link, S.: Characterisations of multivalued dependency implication over undetermined universes. J. Comput. Syst. Sci. 78(4), 1026–1044 (2012)
Niepert, M., Van Gucht, D., Gyssens, M.: Logical and algorithmic properties of stable conditional independence. Int. J. Approx. Reasoning 51(5), 531–543 (2010)
Niepert, M., Van Gucht, D., Gyssens, M.: On the conditional independence implication problem: A lattice-theoretic approach. In: McAllester, D., Myllymäki, P. (eds.) Proceedings of the 24th Conference in Uncertainty in Artificial Intelligence - UAI, pp. 435–443 (2008)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann (1988)
Sagiv, Y., Delobel, C., Parker Jr., D., Fagin, R.: An equivalence between relational database dependencies and a fragment of propositional logic. J. ACM 28(3), 435–453 (1981)
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
Link, S. (2012). Propositional Reasoning about Saturated Conditional Probabilistic Independence. In: Ong, L., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2012. Lecture Notes in Computer Science, vol 7456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32621-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-32621-9_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32620-2
Online ISBN: 978-3-642-32621-9
eBook Packages: Computer ScienceComputer Science (R0)