Dualization in lattices given by implicational bases
DOI10.1007/978-3-030-21462-3_7zbMath1435.68115arXiv1901.07503OpenAlexW3177605298MaRDI QIDQ5919405
Oscar Defrain, Lhouari Nourine
Publication date: 11 February 2020
Published in: Theoretical Computer Science, Formal Concept Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.07503
distributive latticesinterval orderdistributive latticeimplicational baselattice dualizationtransversals enumeration
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Logical aspects of lattices and related structures (03G10) Structure and representation theory of distributive lattices (06D05) Lattices and duality (06D50) Structure theory of lattices (06B05)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Generating all maximal models of a Boolean expression
- The joy of implications, aka pure Horn formulas: mainly a survey
- Dualization in lattices given by ordered sets of irreducibles
- A subclass of Horn CNFs optimally compressible in polynomial time
- Computational aspects of monotone dualization: a brief survey
- On generating all maximal independent sets
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
- Complexity of identification and dualization of positive Boolean functions
- Intransitive indifference with unequal indifference intervals
- Lattice Theory: Foundation
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- New Results on Monotone Dualization and Generating Hypergraph Transversals
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Algorithms for Dualization over Products of Partially Ordered Sets
- Dualization in lattices given by implicational bases
This page was built for publication: Dualization in lattices given by implicational bases