Abstract:
In this paper, we propose a general framework for constraint propagation based on the notion of asynchronous iteration. Two constraint propagation algorithms are derived from this framework, each one based on a different programming paradigm: parallel programming, and distributed programming. Each of these algorithms allows to use a particular hardware architecture in order to realize an implementation that takes advantage of its specificities.