Showing cs.DSShow all
3 papers · 1 filter
cs.DS2025
Translating between the representations of an acyclic convex geometry of bounded degree
Oscar Defrain, Arthur Ohana, Simon Vilmin
We consider the problem of translating between irreducible closed sets and implicational bases in closure systems. To date, the complexity status of this problem is widely open, an…
cs.DS2025
Computing the -base and -relation in finite closure systems
Kira Adaricheva, Lhouari Nourine, Simon Vilmin
Implicational bases (IBs) are a common representation of finite closure systems and lattices, along with meet-irreducible elements. They appear in a wide variety of fields ranging…
cs.DS2025
On the enumeration of signatures of XOR-CNF's
Nadia Creignou, Oscar Defrain, Frédéric Olive +1
Given a CNF formula with clauses over a set of variables , a truth assignment generates a binary sequence $Ï_Ï(\mathbf{a})…