Efficient Enumeration of Solutions Produced by Closure Operations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Efficient Enumeration of Solutions Produced by Closure Operations

Abstract

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 by polymorphisms of a boolean relation with a polynomial delay. Therefore we can compute with polynomial delay the closure of a family of sets by any set of "set operations" (e.g. by union, intersection, difference, symmetric difference ...). To do so, we prove that for any set of operations F, one can decide in polynomial time whether an element belongs to the closure by F of a family of sets. When the relation is over a domain larger than two elements, we prove that our generic enumeration method fails, since the associated decision problem is NP-hard.
Fichier principal
Vignette du fichier
increm2.pdf (513.68 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01388505 , version 1 (23-05-2017)

Identifiers

Cite

Arnaud Mary, Yann Strozecki. Efficient Enumeration of Solutions Produced by Closure Operations. 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, Feb 2016, Orléans, France. ⟨10.4230/LIPIcs.STACS.2016.52⟩. ⟨hal-01388505⟩
141 View
91 Download

Altmetric

Share

Gmail Facebook X LinkedIn More