Theoretical and Computational Properties of Preference-based Argumentation

  • Authors:
  • Yannis Dimopoulos;Pavlos Moraitis;Leila Amgoud

  • Affiliations:
  • University of Cyprus, 75 Kallipoleos Str. 1678, Nicosia-Cyprus;Paris Descartes University, 45 rue des Saints-Pères 75270, Paris-France;Paul Sabatier University, 118 route de Narbonne 31062, Toulouse-France

  • Venue:
  • Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

During the last years, argumentation has been gaining increasing interest in modeling different reasoning tasks of an agent. Many recent works have acknowledged the importance of incorporating preferences or priorities in argumentation. However, relatively little is known about the theoretical and computational implications of preferences in argumentation. In this paper we introduce and study an abstract preference-based argumentation framework that extends Dung's formalism by imposing a preference relation over the arguments. Under some reasonable assumptions about the preference relation, we show that the new framework enjoys desirable properties, such as coherence. We also present theoretical results that shed some light on the role that preferences play in argumentation. Moreover, we show that although some reasoning problems are intractable in the new framework, it appears that the preference relation has a positive impact on the complexity of reasoning.