Translating between the representations of a ranked convex geometry
type: Item
instance of: scholarly article
title: Translating between the representations of a ranked convex geometry
author: Oscar Defrain
author: Lhouari Nourine
author: Simon Vilmin
published in: Discrete Mathematics
publication date: 2021-06-14T00:00:00Z
full work available at URL: https://arxiv.org/abs/1907.09433
Mathematics Subject Classification ID: 06Axx
Mathematics Subject Classification ID: 06Exx
Mathematics Subject Classification ID: 52Axx
zbMATH DE Number: 7358322
zbMATH Keywords: hypergraph dualization
zbMATH Keywords: meet-irreducible enumeration
zbMATH Keywords: characteristic models
zbMATH Keywords: implicational bases
zbMATH Keywords: convex geometries
zbMATH Keywords: lattices
describes a project that uses: JBool
MaRDI profile type: Publication
OpenAlex ID: W3153202227
cites work: Optimum basis of finite convex geometry
cites work: Join-semidistributive lattices and convex geometries.
cites work: On implicational bases of closure systems with unique critical sets.
cites work: Discovery of the \(D\)-basis in binary tables based on hypergraph dualization
cites work: Ordered direct implicational basis of a finite closure system
cites work: Computing premises of a minimal cover of functional dependencies is intractable
cites work: Dualization in lattices given by ordered sets of irreducibles
cites work: Q5685119
cites work: Algorithms for \(k\)-meet-semidistributive lattices
cites work: Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
cites work: The multiple facets of the canonical direct unit implicational basis
cites work: Complexity of identification and dualization of positive Boolean functions
cites work: Q5841991
cites work: Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants
cites work: A subclass of Horn CNFs optimally compressible in polynomial time
cites work: The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
cites work: Q3077976
cites work: Q4530231
cites work: Dualization in lattices given by implicational bases
cites work: A circuit set characterization of antimatroids
cites work: The theory of convex geometries
cites work: Identifying the Minimal Transversals of a Hypergraph and Related Problems
cites work: Computational aspects of monotone dualization: a brief survey
cites work: Algorithms for Dualization over Products of Partially Ordered Sets
cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms
cites work: Q4834373
cites work: Lattice Theory: Special Topics and Applications
cites work: Q5058462
cites work: Representation of lattices via set-colored posets
cites work: Optimal compression of propositional Horn knowledge bases: Complexity and approximation
cites work: On generating all maximal independent sets
cites work: Generating all maximal models of a Boolean expression
cites work: Q4871262
cites work: Q3668890
cites work: Q4023862
cites work: The Factorization and Representation of Lattices
cites work: The prime stems of rooted circuits of closure spaces and minimum implicational bases
cites work: Succinctness and tractability of closure operator representations
cites work: Lattices of regular closed subsets of closure spaces
cites work: Computing the minimum cover of functional dependencies
cites work: Q4256200
cites work: A New Algorithm for Generating All the Maximal Independent Sets
cites work: A theory of finite closure spaces based on implications
cites work: Optimal implicational bases for finite modular lattices
cites work: The joy of implications, aka pure Horn formulas: mainly a survey
DOI: 10.1016/J.DISC.2021.112399
description: scientific article; zbMATH DE number 7358322