Base Logics in Argumentation

  • Authors:
  • Anthony Hunter

  • Affiliations:
  • Department of Computer Science, University College London, Gower Street, London WC1E 6BT, UK, a.hunter@cs.ucl.ac.uk

  • Venue:
  • Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arguments. A common assumption for logic-based argumentation is that an argument is a pair where Φ is a minimal subset of the knowledgebase such that Φ is consistent and Φ entails the claim α. We call the logic used for consistency and entailment, the base logic. Different base logics provide different definitions for consistency and entailment and hence give us different options for argumentation. This paper discusses some of the commonly used base logics in logic-based argumentation, and considers various criteria that can be used to identify commonalities and differences between them.