Maximal sets of solutions for constraint satisfaction problems
David Lesaint · European Conference on Artificial Intelligence · 1994
Real constrained problems often demand specific answers to meet requirements like bounded computation time, user preferences or data changes. In the framework of Constraint Satisfaction Problems, sets of solutions which are maximal cartesian products of sub-domains provide a large amount of information in a synthetic and exploitable fashion. In this paper, standard Forward-Checking is extended and a heuristic is designed to compute such sets via their intensional representation. From experiments and a theoretical analysis, we demonstrate the interest of computing a single set instead of individual solutions.