A finite axiomatization of conditional independence and inclusion dependencies
classification
🧮 math.LO
cs.AIcs.DBcs.LO
keywords
axiomatizationfiniteinclusionconditionaldependenciesimplicationindependenceproblem
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.