Valued-Based Argumentation for Tree-like Value Graphs
Kim, Eun Jung; Ordyniak, Sebastian (2012), Valued-Based Argumentation for Tree-like Value Graphs, in Woltran, Stefan; Szeider, Stefan; Verheij, Bart, Computational Models of Argument, IOS Press, p. 378-389
Book titleComputational Models of Argument
Book authorWoltran, Stefan; Szeider, Stefan; Verheij, Bart
MetadataShow full item record
Author(s)Kim, Eun Jung
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Institute of Information Systems, Vienna University of Technology
Abstract (EN)We consider value-based argumentation frameworks (VAFs) introduced by Bench-Capon (J. Logic Comput. 13, 2003), which has been established as a fruit- ful model to study abstract argumentation systems. It takes into account the relative importance among arguments which reﬂects the value system of an audience. The central issue in the study of VAFs is the decision problems of subjective acceptance and objective acceptance: an argument is subjectively (objectively, resp.) accepted if it is accepted with respect to one audience (all possible audiences, resp.) An im- portant limitation for using VAFs in real-world applications is the computational intractability of the acceptance problems. We identify nontrivial classes in terms of structural restrictions on the underlying graph structure of VAFs and present a polynomial-time algorithm in the spirit of dynamic programming. We supplement the tractability by the hardness result. This extends and generalize the results of Dunne (COMMA 2010) and Kim et al. (Artiﬁcial Intelligence 175, 2011).
Subjects / Keywordssubjective and objective acceptance; polynomial-time tractability; NP-hardness; treewidth; Value-based argumentation frameworks
Showing items related by title and author.