Year: 2020
Type: article
Abstract: Powerful formalisms for abstract argumentation have been proposed, among them abstract dialectical frameworks (ADFs) that allow for a succinct and flexible specification of the relationship between arguments and the GRAPPA framework which allows argumentation scenarios to be represented as arbitrary edge-labeled graphs. The complexity of ADFs and GRAPPA is located beyond NP and ranges up to the third level of the polynomial hierarchy. The combined complexity of Answer Set Programming (ASP) exactly matches this complexity when programs are restricted to predicates of bounded arity. In this paper, we exploit this coincidence and present novel efficient translations from ADFs and GRAPPA to ASP. More specifically, we provide reductions for the five main ADF semantics of admissible, complete, preferred, grounded, and stable interpretations, and exemplify how these reductions need to be adapted for GRAPPA for the admissible, complete, and preferred semantics.
Authors: GERHARD BREWKA, MARTIN DILLER, GEORG HEISSENBERGER, THOMAS LINSBICHLER, STEFAN WOLTRAN
Institutions: Leipzig University, Technische Universität Dresden, TU Wien
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,160
Awards: G3032849772, HYPAR - Hybrid Parameterized Problem Solving in Practice, Advanced Tools for Graph-Based Formal Argumentation, G6218411914, G6991017272, Decodyn: Treating Hard Problems with Decomposition and Dynamic Programming, Logical Methods in Computer Science, TRR 248: Grundlagen verständlicher SoftwareSysteme für eine nachvollziehbare cyberphysische Welt
OpenAlex ID: W2992097852