Optimal implicational bases for finite modular lattices

DOI10.2989/16073600009485964MaRDI QIDQ4521532zbMATH OpenOpenAlexFDO

Authors 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

functional dependenciesimplicational basemodular latticesNP-completerelational database

Mathematics Subject Classification ID

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

Recommendations

• On implicational bases of closure systems with unique critical sets.
• Minimum implicational basis for \(\wedge\)-semidistributive lattices
• The core of finite lattices

Cited in

(14)

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

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

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