Authors:
Federico Bergenti
;
Eleonora Iotti
;
Stefania Monica
and
Agostino Poggi
Affiliation:
Università degli Studi di Parma, Italy
Keyword(s):
Asynchronous Backtracking, JADEL, Distributed Constraint Satisfaction Problems.
Related
Ontology
Subjects/Areas/Topics:
Agents
;
Artificial Intelligence
;
Artificial Intelligence and Decision Support Systems
;
Constraint Satisfaction
;
Distributed and Mobile Software Systems
;
Distributed Problem Solving
;
Enterprise Information Systems
;
Knowledge Engineering and Ontology Development
;
Knowledge-Based Systems
;
Multi-Agent Systems
;
Programming Environments and Languages
;
Software Engineering
;
Symbolic Systems
Abstract:
In this paper, a comparison between the pseudocode of a well-known algorithm for solving distributed constraint satisfaction problems and the implementation of such an algorithm in JADEL is given. First, background and motivations behind JADEL development are illustrated. Then, we make a description of the problem and a brief introduction to JADEL. The core of this work consists in the translation of the algorithm pseudocode in JADEL code, which is described in details. Scope of the paper is to evaluate such a translation, in terms of closeness to pseudocode, complexity, amount of code written and performance.