Computing Arguments and Attacks in Assumption-Based Argumentation

  • Authors:
  • Dorian Gaertner;Francesca Toni

  • Affiliations:
  • Imperial College London;Imperial College London

  • Venue:
  • IEEE Intelligent Systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

CaSAPI (Credulous and Skeptical Argumentation: Prolog Implementation) 3.0 determines the acceptability of claims, using the general-purpose framework of assumption-based argumentation, under the semantics of admissible extensions. This framework reduces the problem of computing arguments for and against claims to the problem of computing assumptions supporting these arguments. Unlike earlier computational models of assumption-based argumentation, CaSAPI 3.0 renders explicit the underlying dialectical structure of arguments and counterarguments. So, this system is beneficial for developing applications of argumentation requiring explicit justifications of claims in terms of full argument structures. This article is part of a special issue on argumentation technology.