A finite axiomatization of conditional independence and inclusion dependencies

2013/09/19 by Miika Hannula, Hannula, Miika, Juha Kontinen +1 · 1 citation
Computer Science · Mathematics · #03C80 #Advanced Database Systems and Queries #Artificial Intelligence (cs.AI) #Databases (cs.DB) #F.4.1 #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Semantic Web and Ontologies #acm:03C80 #cs.AI #cs.DB #cs.LO #math.LO #msc:03C80

paper · pdf · doi:10.48550/arxiv.1309.4927

openalex publication_date 2013/09/19 · arxiv created 2013/09/20 · arxiv updated 2013/09/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• On Dependence Logic

Cited by

• On the Complexity and Properties of Preferential Propositional Dependence Logic

Related

• On the Interaction of Functional and Inclusion Dependencies with Independence Atoms
• R.E. Axiomatization of Conditional Independence
• On Independence Atoms and Keys
• On Dependence Logic
• Dependence Logic in Pregeometries and ω-Stable Theories