2000 character limit reached
A finite axiomatization of conditional independence and inclusion dependencies (1309.4927v2)
Published 19 Sep 2013 in math.LO, cs.AI, cs.DB, and cs.LO
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.