Supporting argumentation systems by graph representation and computation

  • Authors:
  • Jérôme Fortin;Rallou Thomopoulos;Jean-Rémi Bourguet;Marie-Laure Mugnier

  • Affiliations:
  • Université Montpellier II, Montpellier cedex 5, France;INRA/IATE, Montpellier, France;Université Montpellier III, Montpellier, France;Université Montpellier II, Montpellier cedex 5, France

  • Venue:
  • GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Argumentation is a reasoning model based on arguments and on attacks between arguments. It consists in evaluating the acceptability of arguments, according to a given semantics. Due to its generality, Dung's framework for abstract argumentation systems, proposed in 1995, is a reference in the domain. Argumentation systems are commonly represented by graph structures, where nodes and edges respectively represent arguments and attacks between arguments. However beyond this graphical support, graph operations have not been considered as reasoning tools in argumentation systems. This paper proposes a conceptual graph representation of an argumentation system and a computation of argument acceptability relying on conceptual graph default rules.