Monoidal functional dependencies

DOI10.1016/J.JCSS.2015.03.006MaRDI QIDQ2353408zbMATH OpenOpenAlexFDO

Authors Vilem Vychodil

Publication date 13 July 2015

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1409.0980

zbMATH Keywords

axiomatizationfunctional dependencyresiduated latticesimilarity-based databases

Mathematics Subject Classification ID

Logic in computer science (03B70) Ordered semigroups and monoids (06F05) Database theory (68P15)

Abstract: We present a complete logic for reasoning with functional dependencies (FDs) with semantics defined over classes of commutative integral partially ordered monoids and complete residuated lattices. The dependencies allow us to express stronger relationships between attribute values than the ordinary FDs. In our setting, the dependencies not only express that certain values are determined by others but also express that similar values of attributes imply similar values of other attributes. We show complete axiomatization using a system of Armstrong-like rules, comment on related computational issues, and the relational vs. propositional semantics of the dependencies.

Recommendations

• Abstract functional dependency structures
• scientific article; zbMATH DE number 846962
• scientific article; zbMATH DE number 1487583
• Functional dependencies in relations with null values
• scientific article; zbMATH DE number 4009860

Cites work

• A fuzzy representation of data for relational databases
• A logical approach to fuzzy truth hedges
• A proof of the completeness theorem of Grödel
• An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
• Codd's relational model from the point of view of fuzzy logic
• Combining fuzzy information from multiple systems
• Computing minimal sets of descriptive conditions for binary data
• Decomposition of a Data Base and the Theory of Boolean Switching Functions
• Foundations of data quality management
• Functional Dependencies in a Relational Database and Propositional Logic
• Generalizing database relational algebra for the treatment of incomplete or uncertain information and vague queries
• Handbook of mathematical fuzzy logic. Volume 1
• scientific article; zbMATH DE number 3823168 (Why is no real title available?)
• scientific article; zbMATH DE number 51770 (Why is no real title available?)
• scientific article; zbMATH DE number 3464827 (Why is no real title available?)
• scientific article; zbMATH DE number 978992 (Why is no real title available?)
• scientific article; zbMATH DE number 4114587 (Why is no real title available?)
• scientific article; zbMATH DE number 877297 (Why is no real title available?)
• scientific article; zbMATH DE number 7635224 (Why is no real title available?)
• scientific article; zbMATH DE number 2199279 (Why is no real title available?)
• Metamathematics of fuzzy logic
• Minimum Covers in Relational Database Model
• Monoidal t-norm based logic: Towards a logic for left-continuous t-norms
• On Fuzzy Logic I Many‐valued rules of inference
• On Fuzzy Logic II. Enriched residuated lattices and semantics of propositional calculi
• On Fuzzy Logic III. Semantical completeness of some many‐valued propositional calculi
• Optimal aggregation algorithms for middleware.
• Residuated Lattices
• Residuated lattices. An algebraic glimpse at substructural logics
• The finite embeddability property for residuated lattices, pocrims and BCK-algebras.
• The logic of inexact concepts
• Triangular norms

Cited in

(1)

• Abstract functional dependency structures

This page was built for publication: Monoidal functional dependencies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2353408)