Efficient enumeration of solutions produced by closure operations

12/11/2017
by   Arnaud Mary, et al.
0

In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that we can generate the closure of a boolean relation (a set of boolean vectors) by polymorphisms with a polynomial delay. Therefore we can compute with polynomial delay the closure of a family of sets by any set of "set operations": union, intersection, symmetric difference, subsets, supersets ...). To do so, we study the Membership_F problem: for a set of operations F, decide whether an element belongs to the closure by F of a family of elements. In the boolean case, we prove that Membership_F is in P for any set of boolean operations F. When the input vectors are over a domain larger than two elements, we prove that the generic enumeration method fails, since Membership_F is NP-hard for some F. We also study the problem of generating minimal or maximal elements of closures and prove that some of them are related to well known enumeration problems such as the enumeration of the circuits of a matroid or the enumeration of maximal independent sets of a hypergraph. This article improves on previous works of the same authors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/05/2021

Enumerating maximal consistent closed sets in closure systems

Given an implicational base, a well-known representation for a closure s...
research
04/06/2020

Independent sets of closure operations

In this paper independent sets of closure operations are introduced. We ...
research
03/14/2023

Enumerating all minimal hitting sets in polynomial total time

Consider a hypergraph (=set system) ℍ whose h hyperedges are subsets of ...
research
07/18/2023

Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids

Finding a maximum cardinality common independent set in two matroids (al...
research
04/16/2020

Polynomial-delay Enumeration Algorithms in Set Systems

We consider a set system (V, 𝒞⊆ 2^V) on a finite set V of elements, wher...
research
09/07/2017

The Satisfiability Problem for Boolean Set Theory with a Choice Correspondence

Given a set U of alternatives, a choice (correspondence) on U is a contr...
research
04/11/2021

The algebraic structure of the densification and the sparsification tasks for CSPs

The tractability of certain CSPs for dense or sparse instances is known ...

Please sign up or login with your details

Forgot password? Click here to reset