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 suhprohlems 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 generalizahle examples.

Borghoff, U., ARCELLI FONTANA, F., Formato, F., & Pareschi, R. (1998). Constraint-based protocols for distributed problem solving. SCIENCE OF COMPUTER PROGRAMMING, 30, 201-225 [10.1016/S0167-6423(97)00011-7].

Constraint-based protocols for distributed problem solving

ARCELLI FONTANA, FRANCESCA;
1998

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 suhprohlems 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 generalizahle examples.
Articolo in rivista - Articolo scientifico
Constraint propagation; Distributed artificial intelligence; Distributed problem solving: Constraint-based knowledge brokers; Cooperative agents; Protocols
English
201
225
25
Borghoff, U., ARCELLI FONTANA, F., Formato, F., & Pareschi, R. (1998). Constraint-based protocols for distributed problem solving. SCIENCE OF COMPUTER PROGRAMMING, 30, 201-225 [10.1016/S0167-6423(97)00011-7].
Borghoff, U; ARCELLI FONTANA, F; Formato, F; Pareschi, R
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/37689
Citazioni
  • Scopus 8
  • ???jsp.display-item.citation.isi??? 2
Social impact