3 papers
cs.CC2021
Enumerating maximal consistent closed sets in closure systems
Lhouari Nourine, Simon Vilmin
Given an implicational base, a well-known representation for a closure system, an inconsistency binary relation over a finite set, we are interested in the problem of enumerating a…
cs.DM2020
Hierarchical Decompositions of dihypergraphs
Lhouari Nourine, Simon Vilmin
In this paper we are interested in decomposing a dihypergraph into simpler dihypergraphs, that can be handled more efficiently. We study the proper…
cs.DM2019
Translating between the representations of a ranked convex geometry
Oscar Defrain, Lhouari Nourine, Simon Vilmin
It is well known that every closure system can be represented by an implicational base, or by the set of its meet-irreducible elements. In Horn logic, these are respectively known…