A theory of finite closure spaces based on implications
From MaRDI portal
Publication:1341147
DOI10.1006/aima.1994.1069zbMath0863.54002OpenAlexW2072284346MaRDI QIDQ1341147
Publication date: 2 January 1995
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/aima.1994.1069
Database theory (68P15) Topological spaces and generalizations (closure spaces, etc.) (54A05) Combinatorial aspects of matroids and geometric lattices (05B35) Finite geometry and special incidence structures (51E99)
Related Items (29)
The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey ⋮ Attribute-incremental construction of the canonical implication basis ⋮ Optimum basis of finite convex geometry ⋮ Unnamed Item ⋮ A representation of antimatroids by Horn rules and its application to educational systems ⋮ Lattices of regular closed subsets of closure spaces ⋮ Lattice point of view for argumentation framework ⋮ Computations with finite closure systems and implications ⋮ Construction and learnability of canonical Horn formulas ⋮ Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements ⋮ The presence of lattice theory in discrete problems of mathematical social sciences. Why. ⋮ Decision systems in rough set theory: A set operatorial perspective ⋮ The joy of implications, aka pure Horn formulas: mainly a survey ⋮ Learning definite Horn formulas from closure queries ⋮ Weakly submodular rank functions, supermatroids, and the flat lattice of a distributive super\-matroid ⋮ A compact representation for modular semilattices and its applications ⋮ Pseudo-models and propositional Horn inference ⋮ Closure spaces that are not uniquely generated ⋮ The multiple facets of the canonical direct unit implicational basis ⋮ Translating between the representations of a ranked convex geometry ⋮ Incidence algebras that are uniquely determined by their zero-nonzero matrix pattern. ⋮ Going down in (semi)lattices of finite moore families and convex geometries ⋮ On implicational bases of closure systems with unique critical sets. ⋮ Canonical Horn Representations and Query Learning ⋮ Attribute exploration with background knowledge ⋮ Latticial structures in data analysis. ⋮ Realization of abstract convex geometries by point configurations ⋮ Unnamed Item ⋮ Axiomatizing simple binary matroids by their closed circuits
This page was built for publication: A theory of finite closure spaces based on implications
