Sciweavers

Share
STACS
2007
Springer

Enumerating All Solutions for Constraint Satisfaction Problems

11 years 7 months ago
Enumerating All Solutions for Constraint Satisfaction Problems
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´ebrard [CH97] and generalized by Cohen [Coh04], reduces the enumeration problem for a constraint language Γ to the decision problem for a slightly enlarged constraint language Γ+ , i.e., it yields an efficient enumeration algorithm for the case where CSP(Γ+ ) is tractable. We develop a new class of algorithms, yielding efficient enumeration algorithms for a broad class of constraint languages. For the three-element domain, we achieve a first step towards a dichotomy theorem for the enumeration problem. Keywords. computational complexity, constraints, enumeration
Henning Schnoor, Ilka Schnoor
Added 09 Jun 2010
Updated 09 Jun 2010
Type Conference
Year 2007
Where STACS
Authors Henning Schnoor, Ilka Schnoor
Comments (0)
books