Control-driven Constraint Propagation

Eric Monfroy

This article is concerned with two styles of programming: constraint programming and the one employed in coordination languages. A generic framework for constraint propagation is presented using coordination languages. More precisely, concern is with the realization of a control-driven coordination-based version of the generic iteration algorithm for compound domains of K. R. Apt. The goal is to describe constraint propagation as the coordination of cooperative agents, and thus, to provide a flexible, scalable, and generic framework for constraint propagation. Our framework overcomes inherent problems of the parallel and distributed algorithms of E. Monfroy and J.-H. Réty. Other benefits of this coordination based framework is that it does not require special modeling of CSPs and opens up ways for new constraint propagation strategies.

Applied Artificial Intelligence: An International Journal 15(1), pages 789-103, January 2001.
Andrea Omicini, George A. Papadopoulos (eds.), Taylor & Francis
Special Issue: Coordination Models and Languages in AI
Author = {Monfroy, Eric},
Doi = {10.1080/08839510150204626},
Editor = {Omicini, Andrea and Papadopoulos, George A.},
Issn = {0883-9514},
Issn-Online = {1087-6545},
Journal = {Applied Artificial Intelligence: An International Journal},
Month = jan,
Note = {Special Issue: Coordination Models and Languages in {AI}},
Number = 1,
Pages = {79--103},
Publisher = {Taylor \& Francis},
Title = {Control-driven Constraint Propagation},
Url = {},
Url-Pdf = {},
Volume = 15,
Year = 2001}

Partita IVA: 01131710376 - Copyright © 2008-2021 APICe@DISI Research Group - PRIVACY