Enumerating maximal consistent closed sets in closure systems
From MaRDI portal
Publication:2117117
Cites work
- A compact representation for minimizers of k-submodular functions
- A compact representation for modular semilattices and its applications
- A geometric description of modular lattices
- A Simple Solution to the Word Problem for Lattices
- Algorithms for k-meet-semidistributive lattices
- Biatomic lattices
- Candidate keys for relations
- Characterizations of the convex geometries arising from the double shellings of posets
- Convexity in Graphs and Hypergraphs
- Doubling convex sets in lattices: Characterizations and recognition algorithms
- Dualization in lattices given by ordered sets of irreducibles
- Functional dependencies in relational databases: A lattice point of view
- Generating all maximal models of a Boolean expression
- Geodesics in CAT(0) cubical complexes
- Greedoids
- scientific article; zbMATH DE number 1313604 (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?)
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Lattice Theory: Foundation
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
- Median graphs, parallelism and posets
- On generating all maximal independent sets
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- Optimal implicational bases for finite modular lattices
- Optimum basis of finite convex geometry
- Petri nets, event structures and domains. I
- The convexity lattice of a poset
- The joy of implications, aka pure Horn formulas: mainly a survey
- The minimal number of join irreducibles of a finite modular lattice
Cited in
(6)- Enumeration of support-closed subsets in confluent systems
- Systematization of a set of closure techniques
- scientific article; zbMATH DE number 6829393 (Why is no real title available?)
- Enumerating maximal consistent closed sets in closure systems
- Self-adhesivity in lattices of abstract conditional independence models
- Listing closed sets of strongly accessible set systems with applications to data mining
This page was built for publication: Enumerating maximal consistent closed sets in closure systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117117)
