Many works about abstraction of Constraint Satisfaction Problems (CSPs) introduce materials in order to build specific abstractions.
But, to our best knowledge, only two works [2, 9] were devoted to defining frameworks of CSP abstraction. In this paper, we try to go one step beyond by proposing an original
and unifying framework with a two-fold objective: a proposal sufficiently general to embrace previous works and to envision
new forms of abstraction, and sufficiently precise to decide without any ambiguity the correctness of a given abstraction.
This paper has been supported in part by a “contrat de plan Etat-Région Nord/Pasde-Calais” and by the “IUT de Lens”.