Algorithms for k-meet-semidistributive lattices
DOI10.1016/J.TCS.2015.10.029zbMATH Open1357.68287OpenAlexW1869935947MaRDI QIDQ507534FDOQ507534
Authors: Laurent Beaudou, Arnaud Mary, Lhouari Nourine 
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
Recommendations
- Efficient algorithms on distributive lattices
- scientific article; zbMATH DE number 565986
- scientific article; zbMATH DE number 1313604
- scientific article; zbMATH DE number 5610899
- Algorithmic problems in varieties of semigroups
- scientific article; zbMATH DE number 4051899
- scientific article; zbMATH DE number 3946190
- scientific article; zbMATH DE number 4047093
- Some results on semimodular lattices
- scientific article; zbMATH DE number 4066965
Analysis of algorithms (68W40) Knowledge representation (68T30) Nonnumerical algorithms (68W05) Logical aspects of lattices and related structures (03G10) Other generalizations of distributive lattices (06D75)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generating all maximal models of a Boolean expression
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- Title not available (Why is that?)
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Computing the minimum cover of functional dependencies
- Computing premises of a minimal cover of functional dependencies is intractable
- New Results on Monotone Dualization and Generating Hypergraph Transversals
- The number of Moore families on \(n=6\)
- Title not available (Why is that?)
- The multiple facets of the canonical direct unit implicational basis
- On the Structure of Armstrong Relations for Functional Dependencies
- Design by example: An application of Armstrong relations
- Generalizing semidistributivity
- Ordered direct implicational basis of a finite closure system
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal implicational bases for finite modular lattices
- The joy of implications, aka pure Horn formulas: mainly a survey
- Discovery of the \(D\)-basis in binary tables based on hypergraph dualization
- 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
Cited In (8)
- Concept lattices with negative information: a characterization theorem
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements
- Translating between the representations of a ranked convex geometry
- Enumerating maximal consistent closed sets in closure systems
- On the preferred extensions of argumentation frameworks: bijections with naive sets
- A depth-first search algorithm for computing pseudo-closed sets
- The joy of implications, aka pure Horn formulas: mainly a survey
- Minimum implicational basis for \(\wedge\)-semidistributive lattices
This page was built for publication: Algorithms for \(k\)-meet-semidistributive lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507534)
