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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Grädel, E., Väänänen, J.: Dependence and independence. Studia Logica 101(2), 399–410 (2013)
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)
Väänänen, J.: Dependence Logic. Cambridge University Press (2007)
Abramsky, S., Väänänen, J.: Dependence logic, social choice and quantum physics (in preparation)
Geiger, D., Paz, A., Pearl, J.: Axioms and algorithms for inferences involving probabilistic independence. Information and Computation 91(1), 128–141 (1991)
Paolini, G., Väänänen, J.: Dependence Logic in Pregeometries and ω-Stable Theories. ArXiv e-prints abs/1310.7719 (2013)
Väänänen, J., Yang, F.: Propositional dependence logic (2013) (in preparation)
Hannula, M.: Axiomatizing first-order consequences in independence logic. CoRR abs/1304.4164 (2013)
Kontinen, J., Väänänen, J.A.: Axiomatizing first-order consequences in dependence logic. Ann. Pure Appl. Logic 164(11), 1101–1117 (2013)
Galliani, P.: General models and entailment semantics for independence logic. Notre Dame Journal of Formal Logic 54(2), 253–275 (2013)
Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. Database Syst. 4(4), 455–469 (1979)
Armstrong, W.W.: Dependency Structures of Data Base Relationships. In: Proc. of IFIP World Computer Congress, pp. 580–583 (1974)
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)
Paredaens, J.: The interaction of integrity constraints in an information system. J. Comput. Syst. Sci. 20(3), 310–329 (1980)
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)
Herrmann, C.: On the undecidability of implications between embedded multivalued database dependencies. Information and Computation 122(2), 221–235 (1995)
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)
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)
Mitchell, J.C.: The implication problem for functional and inclusion dependencies. Information and Control 56(3), 154–173 (1983)
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)
Beeri, C., Vardi, M.Y.: Formal systems for tuple and equality generating dependencies. SIAM J. Comput. 13(1), 76–98 (1984)
Yannakakis, M., Papadimitriou, C.H.: Algebraic dependencies. J. Comput. Syst. Sci. 25(1), 2–41 (1982)
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)
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)