A finite axiomatization of conditional independence and inclusion dependencies
This work addresses foundational issues in database theory and logic, offering a theoretical framework for dependency implications, but it is incremental as it builds on existing axiomatization efforts.
The paper tackled the problem of axiomatizing conditional independence and inclusion dependencies in dependence logic, achieving a complete finite axiomatization for their unrestricted implication problem. This result also provides a finite axiomatization for inclusion, functional, and embedded multivalued dependencies in unirelational databases.
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.