Extended defeasible reasoning for common goals in n-person argumentation games

Duy Hoang Pham, Guido Governatori, Subhasis Thakur

Research output: Contribution to a Journal (Peer & Non Peer)Articlepeer-review

2 Citations (Scopus)

Abstract

Argumentation games have been proved to be a robust and flexible tool to resolve conflicts 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 more than two agents playing the game. We propose a weighting mechanism for competing premises to tackle with conflicts from multiple agents 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 extended defeasible reasoning an agent can exploit the knowledge that other agents expose in order to promote and defend its main claim.

Original languageEnglish
Pages (from-to)2671-2693
Number of pages23
JournalJournal of Universal Computer Science
Volume15
Issue number13
Publication statusPublished - 2009
Externally publishedYes

Keywords

  • Argumentation systems
  • Artificial intelligence
  • Defeasible reasoning

Fingerprint

Dive into the research topics of 'Extended defeasible reasoning for common goals in n-person argumentation games'. Together they form a unique fingerprint.

Cite this