Minimum implicational basis for \(\wedge\)-semidistributive lattices

DOI10.1016/j.ipl.2006.04.004zbMath1185.06009OpenAlexW2058074526MaRDI QIDQ845722

Lhouari Nourine, Philippe Janssen

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00101743/file/pja_document_article.pdf

zbMATH Keywords

latticealgorithmsclosure systemminimum implicational basis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logical aspects of lattices and related structures (03G10) Other generalizations of distributive lattices (06D75)

Related Items

Compressed representation of learning spaces ⋮ On the complexity of enumerating pseudo-intents ⋮ The joy of implications, aka pure Horn formulas: mainly a survey ⋮ Algorithms for \(k\)-meet-semidistributive lattices ⋮ A depth-first search algorithm for computing pseudo-closed sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subdirect decomposition of concept lattices
• Computing the minimum cover of functional dependencies
• The core of finite lattices
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• A simplicial elimination scheme for \(\wedge\)-semidistributive lattices and interval collapsing
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Optimal implicational bases for finite modular lattices
• Identifying the Minimal Transversals of a Hypergraph and Related Problems

This page was built for publication: Minimum implicational basis for \(\wedge\)-semidistributive lattices