Monoidal functional dependencies
A logic for reasoning with similarity-preserving dependencies is proposed. Its semantics is defined using commutative integral partially ordered monoids. The logic is complete and decidable. A closure-like algorithm for non-contracting sets of dependencies is presented. Two kinds of semantics are discussed: a propositional and a relational one.
functional dependency axiomatization residuated lattice similarity-based databases