Show simple item record

hal.structure.identifierLaboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
dc.contributor.authorKim, Eun Jung*
hal.structure.identifierInstitute of Information Systems, Vienna University of Technology
dc.contributor.authorOrdyniak, Sebastian*
dc.date.accessioned2012-07-16T12:46:23Z
dc.date.available2012-07-16T12:46:23Z
dc.date.issued2012
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/9756
dc.language.isoenen
dc.subjectsubjective and objective acceptanceen
dc.subjectpolynomial-time tractabilityen
dc.subjectNP-hardnessen
dc.subjecttreewidthen
dc.subjectValue-based argumentation frameworksen
dc.subject.ddc511en
dc.titleValued-Based Argumentation for Tree-like Value Graphsen
dc.typeChapitre d'ouvrage
dc.contributor.editoruniversityotherInstitute of Information Systems, Vienna University of Technology;Autriche
dc.description.abstractenWe 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 reflects 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. (Artificial Intelligence 175, 2011).en
dc.identifier.citationpages378-389en
dc.relation.ispartoftitleComputational Models of Argument
dc.relation.ispartofeditorWoltran, Stefan
dc.relation.ispartofeditorSzeider, Stefan
dc.relation.ispartofeditorVerheij, Bart
dc.relation.ispartofpublnameIOS Press
dc.relation.ispartofdate2012
dc.relation.isversionofdoi10.3233/978-1-61499-111-3-378
dc.description.sponsorshipprivateouien
dc.subject.ddclabelPrincipes généraux des mathématiquesen
dc.relation.ispartofisbn978-1-61499-110-6
dc.description.halcandidateoui
dc.description.readershiprecherche
dc.description.audienceInternational
hal.identifierhal-01496454*
hal.version1*
hal.update.actionupdateMetadata*
hal.author.functionaut
hal.author.functionaut


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record