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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-01388505
Contributor : Marie-France Sagot <>
Submitted on : Tuesday, May 23, 2017 - 9:39:00 AM
Last modification on : Thursday, April 18, 2019 - 3:21:07 PM
Document(s) archivé(s) le : Friday, August 25, 2017 - 12:22:53 AM

File

increm2.pdf
Publisher files allowed on an open archive

Identifiers

Citation

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⟩

Share

Metrics

Record views

210

Files downloads

36