A finite axiomatization of conditional independence and inclusion dependencies
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 19 Sep 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.