Complexity results for argumentation-based agent communication
Document Type
Conference Proceeding
Source of Publication
Innovations'07: 4th International Conference on Innovations in Information Technology, IIT
Publication Date
1-1-2007
Abstract
In autonomous multi-agent systems, agents communicate with each other in order to cooperatively resolve problems and achieve joint goals. In advanced applications such as e-business, agents should be able to communicate not only by exchanging simple massages, but by engaging in complex conversations such as persuasions and negotiations. In this paper, we address the computational complexity problem of such conversations where agents are equipped with reasoning capabilities based upon argumentation. We argue that the computational efficiency of these conversations depends on the underlying logical language and on the type of reasoning mechanisms. In addition, we show how a trade-off between complexity andflexibility could be achieved. ©2008 IEEE.
DOI Link
ISBN
9781424418411
Publisher
IEEE Computer Society
First Page
506
Last Page
510
Disciplines
Communication | Computer Sciences
Keywords
Agent communication, Agent computing, Argumentation, Computational complexity, Reasoning
Scopus ID
Recommended Citation
Bentahar, Jamal and Maamar, Zakaria, "Complexity results for argumentation-based agent communication" (2007). All Works. 1000.
https://zuscholars.zu.ac.ae/works/1000
Indexed in Scopus
yes
Open Access
yes
Open Access Type
Green: A manuscript of this publication is openly available in a repository