A finite axiomatization of conditional independence and inclusion dependencies

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, this result implies a finite axiomatization of the unrestricted implication problem for inclusion, functional, and embedded multivalued dependencies in the unirelational case. We also indicate the generality of our approach by showing the analogous result for inclusion and embedded join dependencies.