Bibliographic Details
| Title: |
CONTROL-DRIVEN CONSTRAINT PROPAGATION. |
| Authors: |
Monfroy, Eric1 |
| Source: |
Applied Artificial Intelligence. Jan2001, Vol. 15 Issue 1, p79-103. 25p. |
| Subjects: |
Constraint programming, Programming languages, Parallel processing |
| Abstract: |
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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Applied Artificial Intelligence is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
