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ébrard [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… (More)
DOI: 10.1007/978-3-540-70918-3_59


  • Presentations referencing similar topics