Skip to main content
Article
Complexity results for argumentation-based agent communication
Innovations'07: 4th International Conference on Innovations in Information Technology, IIT
  • Jamal Bentahar, Concordia University
  • Zakaria Maamar, Zayed University
Document Type
Conference Proceeding
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.

ISBN
9781424418411
Publisher
IEEE Computer Society
Keywords
  • Agent communication,
  • Agent computing,
  • Argumentation,
  • Computational complexity,
  • Reasoning
Scopus ID
50249109098
Indexed in Scopus
Yes
Open Access
Yes
Open Access Type
Green: A manuscript of this publication is openly available in a repository
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.380.1005
Citation Information
Jamal Bentahar and Zakaria Maamar. "Complexity results for argumentation-based agent communication" Innovations'07: 4th International Conference on Innovations in Information Technology, IIT (2007) p. 506 - 510
Available at: http://works.bepress.com/zakaria-maamar/115/