The enumeration of meet-irreducible elements based on hierarchical decompositions of implicational bases - Université Clermont Auvergne Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2022

The enumeration of meet-irreducible elements based on hierarchical decompositions of implicational bases

Résumé

We study the well-known problem of translating between two representations of closure systems, namely implicational bases and meet-irreducible elements. Albeit its importance, the problem is open. In this paper, we introduce splits of an implicational base. It is a partitioning operation of the implications which we recursively apply to obtain a binary tree representing a decomposition of the implicational base. We show that this decomposition can be conducted in polynomial time and space in the size of the input implicational base. Focusing on the case of acyclic splits, we obtain a recursive characterization of the meetirreducible elements of the associated closure system. We use this characterization and hypergraph dualization to derive new results for the translation problem in acyclic convex geometries.
Fichier principal
Vignette du fichier
arxiv.pdf (1.34 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03565763 , version 1 (11-02-2022)

Identifiants

  • HAL Id : hal-03565763 , version 1

Citer

Lhouari Nourine, Simon Vilmin. The enumeration of meet-irreducible elements based on hierarchical decompositions of implicational bases. 2022. ⟨hal-03565763⟩
31 Consultations
71 Téléchargements

Partager

Gmail Facebook X LinkedIn More