Optimal implicational bases for finite modular lattices

DOI10.2989/16073600009485964zbMath0963.06006OpenAlexW2025581723MaRDI QIDQ4521532

Marcel Wild

Publication date: 28 June 2001

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073600009485964

zbMATH Keywords

modular latticesrelational databaseNP-completefunctional dependenciesimplicational base

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Combinatorics of partially ordered sets (06A07) Modular lattices, Desarguesian lattices (06C05)

Related Items (13)

Minimum implicational basis for \(\wedge\)-semidistributive lattices ⋮ Optimum basis of finite convex geometry ⋮ On the complexity of enumerating pseudo-intents ⋮ Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements ⋮ Decision systems in rough set theory: A set operatorial perspective ⋮ The joy of implications, aka pure Horn formulas: mainly a survey ⋮ Algorithms for \(k\)-meet-semidistributive lattices ⋮ A compact representation for modular semilattices and its applications ⋮ Cover preserving embedding of modular lattices into partition lattices ⋮ Translating between the representations of a ranked convex geometry ⋮ A depth-first search algorithm for computing pseudo-closed sets ⋮ On implicational bases of closure systems with unique critical sets. ⋮ Enumerating maximal consistent closed sets in closure systems

This page was built for publication: Optimal implicational bases for finite modular lattices