Inserire una breve descrizione delle modifiche fatte
Minor changes are by default collapsed in the page history.
No changes
The page does not exist yet.
Failed to load changes
Version by on
Leave Collaboration
Are you sure you want to leave the realtime collaboration and continue editing alone? The changes you save while editing alone will lead to merge conflicts with the changes auto-saved by the realtime editing session.
Control-driven Constraint Propagation
Eric Monfroy
Applied Artificial Intelligence 15(1), pp. 79–103
gennaio 2001
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.
CM 2000 @ SAC 2000
Applied Artificial Intelligence (AAI)
Special Issue “Coordination Models and Languages in AI” (numero speciale, 2001) — Andrea Omicini, George A. Papadopoulos