Enumerating maximal consistent closed sets in closure systems
From MaRDI portal
Publication:2117117
DOI10.1007/978-3-030-77867-5_4OpenAlexW3173778887MaRDI QIDQ2117117
Publication date: 21 March 2022
Full work available at URL: https://arxiv.org/abs/2102.04245
Cites Work
- Unnamed Item
- 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
- Algorithms for \(k\)-meet-semidistributive lattices
- Geodesics in CAT(0) cubical complexes
- Median graphs, parallelism and posets
- Doubling convex sets in lattices: Characterizations and recognition algorithms
- Greedoids
- Characterizations of the convex geometries arising from the double shellings of posets
- The convexity lattice of a poset
- Biatomic lattices
- On generating all maximal independent sets
- Petri nets, event structures and domains. I
- Functional dependencies in relational databases: A lattice point of view
- Candidate keys for relations
- A geometric description of modular lattices
- A compact representation for minimizers of \(k\)-submodular functions
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- The minimal number of join irreducibles of a finite modular lattice
- A compact representation for modular semilattices and its applications
- Optimum basis of finite convex geometry
- Lattice Theory: Foundation
- Convexity in Graphs and Hypergraphs
- 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
- A Simple Solution to the Word Problem for Lattices
- Dualization in lattices given by implicational bases
This page was built for publication: Enumerating maximal consistent closed sets in closure systems
