Constraint Satisfaction Problems (CSP) belong to a kind of traditional NP-hard problems with a high impact on both research and industrial domains. The goal of these problems is to find a feasible assignment for a group ...