Translating between the representations of a ranked convex geometry

DOI10.1016/j.disc.2021.112399OpenAlexW3153202227MaRDI QIDQ2032718

Simon Vilmin, Oscar Defrain, Lhouari Nourine

Publication date: 14 June 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

latticesconvex geometrieshypergraph dualizationcharacteristic modelsimplicational basesmeet-irreducible enumeration

Mathematics Subject Classification ID

General convexity (52Axx) Ordered sets (06Axx) Boolean algebras (Boolean rings) (06Exx)

Related Items (1)

Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements

Uses Software

• JBool

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Discovery of the \(D\)-basis in binary tables based on hypergraph dualization
• Dualization in lattices given by ordered sets of irreducibles
• Succinctness and tractability of closure operator representations
• Algorithms for \(k\)-meet-semidistributive lattices
• A subclass of Horn CNFs optimally compressible in polynomial time
• On implicational bases of closure systems with unique critical sets.
• Computational aspects of monotone dualization: a brief survey
• The multiple facets of the canonical direct unit implicational basis
• The theory of convex geometries
• Computing the minimum cover of functional dependencies
• On generating all maximal independent sets
• A circuit set characterization of antimatroids
• Optimal compression of propositional Horn knowledge bases: Complexity and approximation
• A theory of finite closure spaces based on implications
• Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
• Representation of lattices via set-colored posets
• Join-semidistributive lattices and convex geometries.
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• Ordered direct implicational basis of a finite closure system
• Computing premises of a minimal cover of functional dependencies is intractable
• The prime stems of rooted circuits of closure spaces and minimum implicational bases
• Optimum basis of finite convex geometry
• Complexity of identification and dualization of positive Boolean functions
• Lattice Theory: Special Topics and Applications
• Lattices of regular closed subsets of closure spaces
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• The Factorization and Representation of Lattices
• A New Algorithm for Generating All the Maximal Independent Sets
• Optimal implicational bases for finite modular lattices
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants
• Algorithms for Dualization over Products of Partially Ordered Sets
• Dualization in lattices given by implicational bases

This page was built for publication: Translating between the representations of a ranked convex geometry