Algorithms for k-meet-semidistributive lattices
From MaRDI portal
Algorithms for \(k\)-meet-semidistributive lattices
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
Cites work
- A simplicial elimination scheme for -semidistributive lattices and interval collapsing
- Computing premises of a minimal cover of functional dependencies is intractable
- Computing the minimum cover of functional dependencies
- Design by example: An application of Armstrong relations
- Discovery of the D-basis in binary tables based on hypergraph dualization
- Doubling convex sets in lattices and a generalized semidistributivity condition
- Dual-bounded generating problems: Partial and multiple transversals of a hypergraph
- Fast algorithms for implication bases and attribute exploration using proper premises
- Generalizing semidistributivity
- Generating all maximal models of a Boolean expression
- scientific article; zbMATH DE number 6519673 (Why is no real title available?)
- scientific article; zbMATH DE number 4084785 (Why is no real title available?)
- scientific article; zbMATH DE number 49085 (Why is no real title available?)
- scientific article; zbMATH DE number 3472099 (Why is no real title available?)
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 3420808 (Why is no real title available?)
- scientific article; zbMATH DE number 3103212 (Why is no real title available?)
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Minimum implicational basis for \(\wedge\)-semidistributive lattices
- New Results on Monotone Dualization and Generating Hypergraph Transversals
- On implicational bases of closure systems with unique critical sets.
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- On the complexity of enumerating pseudo-intents
- On the Structure of Armstrong Relations for Functional Dependencies
- Optimal implicational bases for finite modular lattices
- Ordered direct implicational basis of a finite closure system
- Subdirect decomposition of concept lattices
- The joy of implications, aka pure Horn formulas: mainly a survey
- The multiple facets of the canonical direct unit implicational basis
- The number of Moore families on \(n=6\)
Cited in
(9)- A depth-first search algorithm for computing pseudo-closed sets
- Translating between the representations of a ranked convex geometry
- Enumerating maximal consistent closed sets in closure systems
- Concept lattices with negative information: a characterization theorem
- On the preferred extensions of argumentation frameworks: bijections with naive sets
- The joy of implications, aka pure Horn formulas: mainly a survey
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements
- Enumerating the irreducible closed sets of an acyclic implicational base of bounded degree
- 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)
