Paper Info
Title
Constraint-based protocols for distributed problem solving
Abstract
Distributed Problem Solving (DPS) approaches decompose problems into subproblems to be solved by interacting, cooperative software agents. Thus, DPS is suitable for solving problems characterized by many interdependencies among subproblems in the context of parallel and distributed architectures. Concurrent Constraint Programming (CCP) provides a powerful execution framework for DPS where constraints define local problem solving and the exchange of information among agents declaratively. To optimize DPS, the protocol for constraint communication must be tuned to the specific kind of DPS problem and the characteristics of the underlying system architecture. In this paper, we provide a formal framework for modeling different problems and we show how the framework applies to simple yet generalizable examples.
Year
DOI
Venue
1998
10.1016/S0167-6423(97)00011-7
Science of Computer Programming - Special issue on concurrent constraint programming
Keywords
Field
DocType
cooperative agents,protocols,constraint propagation,distributed problem solving,constraint-based knowledge brokers,distributed artificial intelligence,constraint-based protocol,system architecture,distributed architecture,software agent
Interdependence,Constraint satisfaction,Local consistency,Mathematical optimization,Computer science,Constraint programming,Software agent,Concurrent constraint logic programming,Systems architecture,Constraint logic programming,Distributed computing
Journal
Volume
Issue
ISSN
30
1-2
0167-6423
Citations 
PageRank 
References 
8
0.91
23
Authors
4
Name
Order
Citations
PageRank
Uwe M. Borghoff1412175.51
Remo Pareschi2601162.52
Francesca Arcelli3658.23
Ferrante Formato49810.99