2000 character limit reached
A finite axiomatization of conditional independence and inclusion dependencies
Published 19 Sep 2013 in math.LO, cs.AI, cs.DB, and cs.LO | (1309.4927v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.