On Dualization over Distributive Lattices

DOI10.46298/dmtcs.6742arXiv2006.15337OpenAlexW3037477305MaRDI QIDQ6045449

Khaled M. Elbassioni

Publication date: 31 May 2023

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.15337

zbMATH Keywords

posetenumerationdualizationdistributive latticeimplication base

Mathematics Subject Classification ID

Complete lattices, completions (06B23) Artificial intelligence (68Txx)

Cites Work

• The joy of implications, aka pure Horn formulas: mainly a survey
• Dualization in lattices given by ordered sets of irreducibles
• On the complexity of monotone dualization and generating minimal hypergraph transversals
• On generating all maximal independent sets
• On maximal frequent and minimal infrequent sets in binary matrices
• A fast algorithm for building lattices
• Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
• Dual-bounded generating problems: Weighted transversals of a hypergraph
• On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
• On the dualization in distributive lattices and related problems
• Complexity of identification and dualization of positive Boolean functions
• Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
• Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
• Algorithms for Dualization over Products of Partially Ordered Sets
• Dualization in lattices given by implicational bases
• Unnamed Item

This page was built for publication: On Dualization over Distributive Lattices