Algorithms and complexity results for persuasive argumentation - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Artificial Intelligence Year : 2011

Algorithms and complexity results for persuasive argumentation


The study of arguments as abstract entities and their interaction as introduced by Dung (1995) [1] has become one of the most active research branches within Artificial Intelligence and Reasoning. A main issue for abstract argumentation systems is the selection of acceptable sets of arguments. Value-based argumentation, as introduced by Bench-Capon (2003) [8], extends Dung ºs framework. It takes into account the relative strength of arguments with respect to some ranking representing an audience: an argument is subjectively accepted if it is accepted with respect to some audience, it is objectively accepted if it is accepted with respect to all audiences. Deciding whether an argument is subjectively or objectively accepted, respectively, are computationally intractable problems. In fact, the problems remain intractable under structural restrictions that render the main computational problems for non-value-based argumentation systems tractable. In this paper we identify nontrivial classes of value-based argumentation systems for which the acceptance problems are polynomial-time tractable. The classes are defined by means of structural restrictions in terms of the underlying graphical structure of the value-based system. Furthermore we show that the acceptance problems are intractable for two classes of value-based systems that where conjectured to be tractable by Dunne (2007) [12].


Dates and versions

lirmm-00808004 , version 1 (04-04-2013)



Eunjung Kim, Ordyniak Sebastian, Szeider Stefan. Algorithms and complexity results for persuasive argumentation. Artificial Intelligence, 2011, 175, pp.1722-1736. ⟨10.1016/j.artint.2011.03.001⟩. ⟨lirmm-00808004⟩
76 View
0 Download



Gmail Facebook X LinkedIn More