Algorithms for \(k\)-meet-semidistributive lattices

DOI10.1016/j.tcs.2015.10.029zbMath1357.68287OpenAlexW1869935947MaRDI QIDQ507534

Lhouari Nourine, Laurent Beaudou, Arnaud Mary

Publication date: 6 February 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.10.029

zbMATH Keywords

\(k\)-meet-semidistributive latticecolored posetimplicational base

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Knowledge representation (68T30) Logical aspects of lattices and related structures (03G10) Other generalizations of distributive lattices (06D75)

Related Items

On the preferred extensions of argumentation frameworks: bijections with naive sets ⋮ Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements ⋮ The joy of implications, aka pure Horn formulas: mainly a survey ⋮ Concept lattices with negative information: a characterization theorem ⋮ Translating between the representations of a ranked convex geometry ⋮ A depth-first search algorithm for computing pseudo-closed sets ⋮ Enumerating maximal consistent closed sets in closure systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating all maximal models of a Boolean expression
• The joy of implications, aka pure Horn formulas: mainly a survey
• Discovery of the \(D\)-basis in binary tables based on hypergraph dualization
• Design by example: An application of Armstrong relations
• On the complexity of enumerating pseudo-intents
• On implicational bases of closure systems with unique critical sets.
• Subdirect decomposition of concept lattices
• Minimum implicational basis for \(\wedge\)-semidistributive lattices
• Doubling convex sets in lattices and a generalized semidistributivity condition
• The multiple facets of the canonical direct unit implicational basis
• Computing the minimum cover of functional dependencies
• Generalizing semidistributivity
• The number of Moore families on \(n=6\)
• Ordered direct implicational basis of a finite closure system
• Computing premises of a minimal cover of functional dependencies is intractable
• Fast algorithms for implication bases and attribute exploration using proper premises
• A simplicial elimination scheme for \(\wedge\)-semidistributive lattices and interval collapsing
• Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
• On the Structure of Armstrong Relations for Functional Dependencies
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Optimal implicational bases for finite modular lattices
• New Results on Monotone Dualization and Generating Hypergraph Transversals
• Identifying the Minimal Transversals of a Hypergraph and Related Problems