Minimum implicational basis for -semidistributive lattices

DOI10.1016/J.IPL.2006.04.004MaRDI QIDQ845722zbMATH OpenOpenAlexFDO

Authors Philippe Janssen, Lhouari Nourine

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

algorithmsclosure systemlatticeminimum implicational basis

Mathematics Subject Classification ID

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

Recommendations

• Algorithms for k-meet-semidistributive lattices
• Optimal implicational bases for finite modular lattices
• scientific article; zbMATH DE number 5181720

Cites work

• A simplicial elimination scheme for -semidistributive lattices and interval collapsing
• Computing the minimum cover of functional dependencies
• scientific article; zbMATH DE number 3823168 (Why is no real title available?)
• scientific article; zbMATH DE number 1534358 (Why is no real title available?)
• scientific article; zbMATH DE number 1931696 (Why is no real title available?)
• scientific article; zbMATH DE number 758787 (Why is no real title available?)
• scientific article; zbMATH DE number 877297 (Why is no real title available?)
• scientific article; zbMATH DE number 7635224 (Why is no real title available?)
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Optimal implicational bases for finite modular lattices
• Subdirect decomposition of concept lattices
• The core of finite lattices
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey

Cited in

(7)

• Compressed representation of learning spaces
• A depth-first search algorithm for computing pseudo-closed sets
• A simplicial elimination scheme for -semidistributive lattices and interval collapsing
• Optimal implicational bases for finite modular lattices
• The joy of implications, aka pure Horn formulas: mainly a survey
• Algorithms for k-meet-semidistributive lattices
• On the complexity of enumerating pseudo-intents

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845722)