The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey

DOI10.1016/S0166-218X(02)00209-3zbMath1026.06008OpenAlexW2158470853MaRDI QIDQ1874537

Publication date: 25 May 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00209-3

zbMATH Keywords

survey closure operator functional dependency relational databases closure system canonical basis dependence relation implicational system lower bounded lattice meet-distributive lattice

Mathematics Subject Classification ID

Database theory (68P15) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items

Closure systems, implicational systems, overhanging relations and the case of hierarchical classification ⋮ Cryptomorphic topological structures: a computational, relation-algebraic approach ⋮ SOME ORDER DUALITIES IN LOGIC, GAMES AND CHOICES ⋮ Computing Dependencies Using FCA ⋮ Minimum implicational basis for \(\wedge\)-semidistributive lattices ⋮ The structure of the overhanging relations associated with some types of closure systems ⋮ Lattices, closures systems and implication bases: a survey of structural aspects and algorithms ⋮ Recursive decomposition and bounds of the lattice of Moore co-families. ⋮ Knowledge spaces from a topological point of view ⋮ Optimum basis of finite convex geometry ⋮ Fuzzy closure systems: motivation, definition and properties ⋮ A representation of antimatroids by Horn rules and its application to educational systems ⋮ Unique key Horn functions ⋮ The poset of closure systems on an infinite poset: detachability and semimodularity ⋮ On the relation between the subadditivity cone and the quantum entropy cone ⋮ On some generalization of rough sets ⋮ The algebraic structure of the densification and the sparsification tasks for CSPs ⋮ Representations for the largest extension of a closure system ⋮ On the commutative diagrams among Galois connections involved in closure structures ⋮ Ordinal motifs in lattices ⋮ On the lattice of conceptual measurements ⋮ Spaces with fuzzy partitions and fuzzy transform ⋮ Isolated sublattices and their application to counting closure operators ⋮ The presence of lattice theory in discrete problems of mathematical social sciences. Why. ⋮ Matroidal approaches to rough sets via closure operators ⋮ On critical sets of a finite Moore family ⋮ Knowledge Spaces and Reduction of Covering Approximation Spaces ⋮ Abstract Concept Lattices ⋮ Enumeration of 2-level polytopes ⋮ New representations of algebraic domains and algebraic L-domains via closure systems ⋮ Closure via functional dependence simplification ⋮ The joy of implications, aka pure Horn formulas: mainly a survey ⋮ Discovery of the \(D\)-basis in binary tables based on hypergraph dualization ⋮ Succinctness and tractability of closure operator representations ⋮ RQL: a query language for rule discovery in databases ⋮ Solving computational tasks on finite topologies by means of relation algebra and the \textsc{RelView} tool ⋮ Algorithms for tight spans and tropical linear spaces ⋮ Recursive decomposition tree of a Moore co-family and closure algorithm. ⋮ Transformations of discrete closure systems ⋮ Non-deterministic ideal operators: an adequate tool for formalization in data bases ⋮ Characterizing functional dependencies in formal concept analysis with pattern structures ⋮ The duality between the anti-exchange closure operators and the path independent choice operators on a finite set ⋮ Size of random Galois lattices and number of closed frequent itemsets ⋮ Contact, closure, topology, and the linking of row and column types of relations ⋮ Generalized domination in closure systems ⋮ The multiple facets of the canonical direct unit implicational basis ⋮ The lattice of strict completions of a finite poset. ⋮ A new characterization of the path independent choice functions ⋮ Translating between the representations of a ranked convex geometry ⋮ The topology of a quantale valued metric space ⋮ Most specific consequences in the description logic \(\mathcal{E} \mathcal{L} \) ⋮ Going down in (semi)lattices of finite moore families and convex geometries ⋮ Hyper-relations, choice functions, and orderings of opportunity sets ⋮ Characterizing approximate-matching dependencies in formal concept analysis with pattern structures ⋮ On implicational bases of closure systems with unique critical sets. ⋮ Horn representation of a concept lattice ⋮ Choice functions and extensive operators ⋮ Frame cellular automata: Configurations, generating sets and related matroids ⋮ Unnamed Item ⋮ Computing and Visualizing Closure Objects Using Relation Algebra and RelView ⋮ On geometric posets and partial matroids ⋮ Approximating Minimum Representations of Key Horn Functions ⋮ Moore systems and Moore convergence classes of families of nets ⋮ Exploring scale-measures of data sets

Cites Work