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

DOI10.1016/j.tcs.2023.114030arXiv2202.05536OpenAlexW4381384186MaRDI QIDQ6165553

Lhouari Nourine, Simon Vilmin

Publication date: 1 August 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

meet-irreducible elementsclosure systemshypergraph dualizationcharacteristic modelsimplicational bases

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• 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
• Algorithms for \(k\)-meet-semidistributive lattices
• On the complexity of enumerating pseudo-intents
• On implicational bases of closure systems with unique critical sets.
• The multiple facets of the canonical direct unit implicational basis
• Characterizations of the convex geometries arising from the double shellings of posets
• The theory of convex geometries
• Computing the minimum cover of functional dependencies
• On generating all maximal independent sets
• Functional dependencies in relational databases: A lattice point of view
• Direct product decompositions of lattices, closures and relation schemes
• Candidate keys for relations
• 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
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Ordered direct implicational basis of a finite closure system
• Computing premises of a minimal cover of functional dependencies is intractable
• On the dualization in distributive lattices and related problems
• Translating between the representations of a ranked convex geometry
• Attribute-incremental construction of the canonical implication basis
• Lattice Theory: Foundation
• Convexity in Graphs and Hypergraphs
• Minimal Representation of Directed Hypergraphs
• Worst-case Analysis of Set Union Algorithms
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
• The Factorization and Representation of Lattices
• Algorithms for inferring functional dependencies from relations
• Optimal implicational bases for finite modular lattices
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• Notes on join semidistributive lattices
• A cost function for similarity-based hierarchical clustering

This page was built for publication: Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements