In this paper, we present a Java constraint programming prototype called AbsCon which has been conceived to deal with CSP abstraction. AbsCon considers n-ary constraints and implements different value and variable ordering heuristics as well as different propagation
methods. As AbsCon exploits object technology, it is easy to extend its functionalities.
This paper has been supported in part by a “contrat de plan Etat-Région Nord/Pasde-Calais” and by the “IUT de Lens”.