A finite axiomatization of conditional independence and inclusion dependencies
Logic
2013-09-23 v2 Artificial Intelligence
Databases
Logic in Computer Science
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.
Keywords
Cite
@article{arxiv.1309.4927,
title = {A finite axiomatization of conditional independence and inclusion dependencies},
author = {Miika Hannula and Juha Kontinen},
journal= {arXiv preprint arXiv:1309.4927},
year = {2013}
}