Skip to main content
SpringerLink
Log in

A Finite Axiomatization of Conditional Independence and Inclusion Dependencies

  • Conference paper
Foundations of Information and Knowledge Systems (FoIKS 2014)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8367))

Abstract

We present a complete finite axiomatization of the unrestricted implication problem for inclusion and conditional independence atoms in the context of dependence logic. For databases, our result implies a finite axiomatization of the unrestricted implication problem for inclusion, functional, and embedded multivalued dependencies in the unirelational case.

The authors were supported by grant 264917 of the Academy of Finland.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Grädel, E., Väänänen, J.: Dependence and independence. Studia Logica 101(2), 399–410 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  2. Galliani, P.: Inclusion and exclusion dependencies in team semantics: On some logics of imperfect information. Annals of Pure and Applied Logic 163(1), 68–84 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  3. Väänänen, J.: Dependence Logic. Cambridge University Press (2007)

    Google Scholar 

  4. Abramsky, S., Väänänen, J.: Dependence logic, social choice and quantum physics (in preparation)

    Google Scholar 

  5. Geiger, D., Paz, A., Pearl, J.: Axioms and algorithms for inferences involving probabilistic independence. Information and Computation 91(1), 128–141 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  6. Paolini, G., Väänänen, J.: Dependence Logic in Pregeometries and ω-Stable Theories. ArXiv e-prints abs/1310.7719 (2013)

    Google Scholar 

  7. Väänänen, J., Yang, F.: Propositional dependence logic (2013) (in preparation)

    Google Scholar 

  8. Hannula, M.: Axiomatizing first-order consequences in independence logic. CoRR abs/1304.4164 (2013)

    Google Scholar 

  9. Kontinen, J., Väänänen, J.A.: Axiomatizing first-order consequences in dependence logic. Ann. Pure Appl. Logic 164(11), 1101–1117 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  10. Galliani, P.: General models and entailment semantics for independence logic. Notre Dame Journal of Formal Logic 54(2), 253–275 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  11. Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. Database Syst. 4(4), 455–469 (1979)

    Article  Google Scholar 

  12. Armstrong, W.W.: Dependency Structures of Data Base Relationships. In: Proc. of IFIP World Computer Congress, pp. 580–583 (1974)

    Google Scholar 

  13. Casanova, M.A., Fagin, R., Papadimitriou, C.H.: Inclusion dependencies and their interaction with functional dependencies. In: Proceedings of the 1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1982, pp. 171–176. ACM, New York (1982)

    Chapter  Google Scholar 

  14. Paredaens, J.: The interaction of integrity constraints in an information system. J. Comput. Syst. Sci. 20(3), 310–329 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  15. Kontinen, J., Link, S., Väänänen, J.: Independence in database relations. In: Libkin, L., Kohlenbach, U., de Queiroz, R. (eds.) WoLLIC 2013. LNCS, vol. 8071, pp. 179–193. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  16. Herrmann, C.: On the undecidability of implications between embedded multivalued database dependencies. Information and Computation 122(2), 221–235 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  17. Herrmann, C.: Corrigendum to “on the undecidability of implications between embedded multivalued database dependencies”. Inf. Comput. 122, 221–235 (1995); Inf. Comput. 204(12), 1847–1851 (2006)

    Google Scholar 

  18. Chandra, A.K., Vardi, M.Y.: The implication problem for functional and inclusion dependencies is undecidable. SIAM Journal on Computing 14(3), 671–677 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  19. Mitchell, J.C.: The implication problem for functional and inclusion dependencies. Information and Control 56(3), 154–173 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  20. Sadri, F., Ullman, J.D.: Template dependencies: A large class of dependencies in relational databases and its complete axiomatization. J. ACM 29(2), 363–372 (1982)

    Article  MATH  Google Scholar 

  21. Beeri, C., Vardi, M.Y.: Formal systems for tuple and equality generating dependencies. SIAM J. Comput. 13(1), 76–98 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  22. Yannakakis, M., Papadimitriou, C.H.: Algebraic dependencies. J. Comput. Syst. Sci. 25(1), 2–41 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  23. Galliani, P., Hannula, M., Kontinen, J.: Hierarchies in independence logic. In: Rocca, S.R.D. (ed.) Computer Science Logic 2013 (CSL 2013). Leibniz International Proceeding3s in Informatics (LIPIcs), vol. 23, pp. 263–280. Dagstuhl, Germany, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik (2013)

    Google Scholar 

  24. Galliani, P., Väänänen, J.A.: On dependence logic. In: Baltag, A., Smets, S. (eds.) Johan van Benthem on Logical and Informational Dynamics. Springer (to appear)

    Google Scholar 

  25. Galliani, P., Hella, L.: Inclusion Logic and Fixed Point Logic. In: Rocca, S.R.D. (ed.) Computer Science Logic (CSL 2013), Dagstuhl, Germany. Leibniz International Proceedings in Informatics (LIPIcs), vol. 23, pp. 281–295. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik (2013)

    Google Scholar 

  26. Naumov, P., Nicholls, B.: R.E. axiomatization of conditional independence. In: Proceedings of the 14th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2013), pp. 131–137 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, University of Helsinki, P.O. Box 68, 00014, Helsinki, Finland

    Miika Hannula & Juha Kontinen

Authors
  1. Miika Hannula
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Juha Kontinen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät für Mathematik und Informatik, FernUniversität in Hagen, Universitätstrasse 1, 58084, Hagen, Germany

    Christoph Beierle

  2. Istituto di Scienza e Tecnologie della Informazione, Consiglio Nazionale delle Ricerche, Via G. Moruzzi 1, 56124, Pisa, Italy

    Carlo Meghini

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Hannula, M., Kontinen, J. (2014). A Finite Axiomatization of Conditional Independence and Inclusion Dependencies. In: Beierle, C., Meghini, C. (eds) Foundations of Information and Knowledge Systems. FoIKS 2014. Lecture Notes in Computer Science, vol 8367. Springer, Cham. https://doi.org/10.1007/978-3-319-04939-7_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04939-7_10

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04938-0

  • Online ISBN: 978-3-319-04939-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation