• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

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

View/Open
publi1754.pdf (288.2Kb)
Type
Chapitre d'ouvrage
Date
2012
Book title
Computational Models of Argument
Book author
Woltran, Stefan; Szeider, Stefan; Verheij, Bart
Publisher
IOS Press
ISBN
978-1-61499-110-6
Pages
378-389
Publication identifier
10.3233/978-1-61499-111-3-378
Metadata
Show full item record
Author(s)
Kim, Eun Jung
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Ordyniak, Sebastian
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 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).
Subjects / Keywords
subjective and objective acceptance; polynomial-time tractability; NP-hardness; treewidth; Value-based argumentation frameworks

Related items

Showing items related by title and author.

  • Thumbnail
    The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation 
    Kim, Eun Jung; Ordyniak, Sebastian; Szeider, Stefan (2014) Communication / Conférence
  • Thumbnail
    On the tree-width of even-hole-free graphs 
    Aboulker, Pierre; Adler, Isolde; Kim, Eun Jung; Sintiari, Ni Luh Dewi; Trotignon, Nicolas (2021) Document de travail / Working paper
  • Thumbnail
    An FPT 2-Approximation for Tree-Cut Decomposition 
    Kim, Eun Jung; Oum, Sang-il; Paul, Christophe; Sau Valls, Ignasi; Thilikos, Dimitrios M. (2018) Article accepté pour publication ou publié
  • Thumbnail
    An FPT 2-Approximation for Tree-cut Decomposition 
    Kim, Eun Jung; Oum, Sang-Il; Paul, Christophe; Sau Valls, Ignasi; Thilikos, Dimitrios M. (2015) Communication / Conférence
  • Thumbnail
    QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs 
    Bonnet, Édouard; Giannopoulos, Panos; Kim, Eun Jung; Rzążewski, Pawel; Sikora, Florian (2018) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo