Minimum implicational basis for ∧-semidistributive lattices
Authors:
- 1 September 2006
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 99 (5) , 199-202
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A Simplicial elimination scheme for ?-semidistributive lattices and interval collapsingAlgebra universalis, 2003
- The lattices of closure systems, closure operators, and implicational systems on a finite set: a surveyDiscrete Applied Mathematics, 2003
- Hypergraph Transversal Computation and Related Problems in Logic and AILecture Notes in Computer Science, 2002
- Optimal implicational bases for finite modular latticesQuaestiones Mathematicae, 2000
- Unbounded semidistributive latticesAlgebra and Logic, 2000
- On the Complexity of Dualization of Monotone Disjunctive Normal FormsJournal of Algorithms, 1996
- Identifying the Minimal Transversals of a Hypergraph and Related ProblemsSIAM Journal on Computing, 1995
- The core of finite latticesDiscrete Mathematics, 1991
- Computing the minimum cover of functional dependenciesInformation Processing Letters, 1986
- Subdirect decomposition of concept latticesAlgebra universalis, 1983