Formal Systems for Tuple and Equality Generating Dependencies
Catriel Beeri, Moshe Y. Vardi · SIAM Journal on Computing · 1984
We develop several formal systems for tuple and equality generating dependencies. There are three kinds of systems, based upon substitution, tuple elimination and transitivity. We specialize our systems to several subclasses: total dependencies, template dependencies and binary dependencies. We also show that finding a formal system for embedded multivalued dependencies is equivalent to solving the implication problem for that class.