pagemagnifierBibTeX_logo.pngmagnifierpage_white_acrobatmagnifier

Eric Monfroy

Applied Artificial Intelligence: An International Journal 15(1), pages 789-103
January 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.

Special Issue: Coordination Models and Languages in AI

Journals & Series

Publication

— authors

Eric Monfroy

— editors

Andrea Omicini, George A. Papadopoulos

— status

published

— sort

article in journal

— publication date

January 2001

— journal

Applied Artificial Intelligence: An International Journal

— volume

15

— issue

1

— pages

789-103

URLs

original page  |  original PDF

identifiers

— DOI

10.1080/08839510150204626

— print ISSN

0883-9514

— online ISSN

1087-6545

notes

— note

Special Issue: Coordination Models and Languages in AI

Partita IVA: 01131710376 — Copyright © 2008–2023 APICe@DISI – PRIVACY