Test d’inconsistance du problème de satisfaction de contraintes basé sur la coloration de la microstructure

Abstract

several problems such as coloring of geographic maps, job design... However there are two large families : The first family represents the complete methods which consists in making a route total solution search space, however their complexity increases exponentially with the size of the problem. The second family represents the incomplete methods that make a local exploration in the space of search for solutions. These methods have been used effectively to find solutions to large problems that complete methods cannot solve. These incomplete methods do not prove the inconsistency of a Constraint Satisfaction Problem (CSP) instance. Among the challenges put forward by the CP community of Selman and al in 1997 is to propose efficient incomplete methods to show the inconsistency of Constraint Satisfaction Problem (CSP). Our work consists of taking up and possibly continuing the contribution of Saïdi and Benhamou made in 2008 in which the authors introduce a new incomplete method for the inconsistency test which is based on the notion of dominance between CSPs ( Constraint Satisfaction Problem ) and the staining of the Constraint Satisfaction Problem (CSP) microstructure.