JUCS - Journal of Universal Computer Science 15(13): 2653-2675, doi: 10.3217/jucs-015-13-2653
Extended Defeasible Reasoning for Common Goals in n-Person Argumentation Games
Duy Hoang Pham‡, Guido Governatori§, Subhasis Thakur|‡ Posts and Telecommunications Institute of Technology, Hanoi, Vietnam§ NICTA, Queensland Research Laboratory, Brisbane, Australia| Griffith University, Brisbane, Australia
Corresponding author: Duy Pham ( phamhduy@gmail.com ) © Duy Pham, Guido Governatori, Subhasis Thakur. This article is freely available under the J.UCS Open Content License. Citation:
Pham DH, Governatori G, Thakur S (2009) Extended Defeasible Reasoning for Common Goals in n-Person Argumentation Games. JUCS - Journal of Universal Computer Science 15(13): 2653-2675. https://doi.org/10.3217/jucs-015-13-2653 |  |
Abstract
Argumentation games have been proved to be a robust and flexible tool to resolveconflicts among agents. An agent can propose its explanation and its goal known as a claim, which can be refuted by other agents. The situation is more complicated when there are morethan two agents playing the game. We propose a weighting mechanism for competing premises to tackle with conflicts from multipleagents in an n-person game. An agent can defend its proposal by giving a counter-argument to change the "opinion" of the majority of opposing agents. Furthermore, using the extendeddefeasible reasoning an agent can exploit the knowledge that other agents expose in order to promote and defend its main claim.
Keywords
artificial intelligence, defeasible reasoning, argumentation systems