THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS
From MaRDI portal
Publication:4029566
DOI10.1142/S0218196792000256zbMath0798.68049OpenAlexW2008149162WikidataQ114614795 ScholiaQ114614795MaRDI QIDQ4029566
Publication date: 28 March 1993
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196792000256
polynomial time algorithmclosure operatorsrelational databasesfunctional dependenciesconcept latticesnormal decompositionscritical quotientscomplete join-congruence
Related Items (17)
The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey ⋮ Attribute-incremental construction of the canonical implication basis ⋮ Alan Day's work on modular and arguesian lattices ⋮ Computers and universal algebra: Some directions ⋮ Lattices, closures systems and implication bases: a survey of structural aspects and algorithms ⋮ Unnamed Item ⋮ Horn axiomatizations for sequential data ⋮ The poset of closure systems on an infinite poset: detachability and semimodularity ⋮ On critical sets of a finite Moore family ⋮ OnL-fuzzy Chu correspondences ⋮ The joy of implications, aka pure Horn formulas: mainly a survey ⋮ Succinctness and tractability of closure operator representations ⋮ Optimizations in computing the Duquenne-Guigues basis of implications ⋮ On the Merge of Factor Canonical Bases ⋮ Characterizing approximate-matching dependencies in formal concept analysis with pattern structures ⋮ On implicational bases of closure systems with unique critical sets. ⋮ Quasi-closed elements in fuzzy posets
This page was built for publication: THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS
