TY - GEN
T1 - Specification and complexity of strategic-based reasoning using argumentation
AU - Mbarki, Mohamed
AU - Bentahar, Jamal
AU - Moulin, Bernard
PY - 2007
Y1 - 2007
N2 - In this paper, we propose a new strategic and tactic reasoning for agent communication. This reasoning framework is specified using argumentation theory combined to a relevance theory. Strategic reasoning enables agents to decide about the global communication plan in terms of the macro-actions to perform in order to achieve the main conversational goal. Tactic reasoning, on the other hand, allows agents to locally select, at each moment, the most appropriate argument according to the adopted strategy. Previous efforts at defining and formalizing strategies for argumentative agents have often neglected the tactic level and the relation between strategic and tactic levels. In this paper, we propose a formal framework for strategic and tactic reasoning for rational communicating agents and the relation between these two kinds of reasoning. Furthermore, we address the computational complexity of this framework and we argue that this complexity is in the same level of the polynomial hierarchy than the complexity of the strategic-free argumentation reasoning.
AB - In this paper, we propose a new strategic and tactic reasoning for agent communication. This reasoning framework is specified using argumentation theory combined to a relevance theory. Strategic reasoning enables agents to decide about the global communication plan in terms of the macro-actions to perform in order to achieve the main conversational goal. Tactic reasoning, on the other hand, allows agents to locally select, at each moment, the most appropriate argument according to the adopted strategy. Previous efforts at defining and formalizing strategies for argumentative agents have often neglected the tactic level and the relation between strategic and tactic levels. In this paper, we propose a formal framework for strategic and tactic reasoning for rational communicating agents and the relation between these two kinds of reasoning. Furthermore, we address the computational complexity of this framework and we argue that this complexity is in the same level of the polynomial hierarchy than the complexity of the strategic-free argumentation reasoning.
UR - http://www.scopus.com/inward/record.url?scp=38549110570&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-75526-5_9
DO - 10.1007/978-3-540-75526-5_9
M3 - Conference contribution
AN - SCOPUS:38549110570
SN - 354075525X
SN - 9783540755258
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 142
EP - 150
BT - Argumentation in Multi-Agent Systems - Third International Workshop, ArgMAS 2006, Revised Selected and Invited Papers
PB - Springer Verlag
T2 - 3rd International Workshop on Argumentation in Multiagent Systems, ArgMAS 2006
Y2 - 8 May 2006 through 8 May 2006
ER -