Abstract
The objective of this paper is to obtain the full global arc consistency of a CSP as a result of interactions between simple and reactive agents. Thus, a Multi-Agent model is proposed and discussed in terms of correctness, termination and complexity. This model consists of Constraint Agents in interaction by exchanging inconsistent values. A comparative analysis with AC-7 [2] is also done.