EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Solving Advanced Argumentation Problems with Answer Set Programming

GERHARD BREWKA, MARTIN DILLER, GEORG HEISSENBERGER, THOMAS LINSBICHLER, STEFAN WOLTRAN

Theory and Practice of Logic Programming · 2020-05 · 20 (3) · 391-431

DOI: 10.1017/s1471068419000474 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Theory and Practice of Logic Programming, online erschienen am 15.01.2020. Verfasst von GERHARD BREWKA und 4 weiteren Autor:innen. Die Arbeit wurde bisher 8-mal zitiert (Crossref) und nennt 57 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

BREWKA, G., DILLER, M., HEISSENBERGER, G., LINSBICHLER, T., & WOLTRAN, S. (2020). Solving Advanced Argumentation Problems with Answer Set Programming. Theory and Practice of Logic Programming, 20(3), 391-431. https://doi.org/10.1017/s1471068419000474

Vancouver

BREWKA G, DILLER M, HEISSENBERGER G, LINSBICHLER T, WOLTRAN S. Solving Advanced Argumentation Problems with Answer Set Programming. Theory and Practice of Logic Programming. 2020;20(3):391-431. doi:10.1017/s1471068419000474

BibTeX
@article{BREWKA2020,
  author = {BREWKA, GERHARD and DILLER, MARTIN and HEISSENBERGER, GEORG and LINSBICHLER, THOMAS and WOLTRAN, STEFAN},
  title = {Solving Advanced Argumentation Problems with Answer Set Programming},
  journal = {Theory and Practice of Logic Programming},
  year = {2020},
  volume = {20},
  number = {3},
  pages = {391--431},
  doi = {10.1017/s1471068419000474}
}
Kostenlos starten →