Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/978-3-540-75526-5_9 | Lecture Notes in Artificial Intelligence |
Keywords | Field | DocType |
computational complexity | Polynomial hierarchy,Argumentative,Relevance theory,Computer science,Argumentation theory,Communication Plan,Artificial intelligence,Deductive reasoning,Computational complexity theory | Conference |
Volume | ISSN | Citations |
4766 | 0302-9743 | 15 |
PageRank | References | Authors |
0.65 | 24 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohamed Mbarki | 1 | 41 | 6.85 |
| Jamal Bentahar | 2 | 1107 | 96.78 |
| Bernard Moulin | 3 | 303 | 38.80 |