Monoidal functional dependencies

作者：

Highlights：

• 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.

摘要

•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.

论文关键词：Axiomatization,Functional dependency,Residuated lattice,Similarity-based databases

论文评审过程：Received 17 September 2014, Revised 23 March 2015, Accepted 29 March 2015, Available online 15 April 2015, Version of Record 10 June 2015.

论文官网地址：https://doi.org/10.1016/j.jcss.2015.03.006