[Zurück]

W. Dvorak, S. Woltran, A. Gressler:
"Evaluating SETAFs via Answer-Set Programming";
Vortrag: 2nd International Workshop on Systems and Algorithms for Formal Argumentation, Warschau; 11.09.2018; in: "2nd International Workshop on Systems and Algorithms for Formal Argumentation", CEUR-WS.org, 2171 (2018), ISSN: 1613-0073; S. 10 - 21.

Following the tradition of the ASPARTIX system, we present answer-set programming encodings for the main semantics of argumentation frameworks with collective attacks (also known as SETAFs). By that, we provide the first system dedicated to reasoning in SETAFs. Since to date, no known polynomial-time (with respect to the number of arguments) translation from SETAFs to Dung-style frame-works is known, genuine implementations for SETAFs appear necessary towards practically efficient systems for this particular formalism. As a by-product, we in-troduce semi-stable and stage semantics for SETAFs and pinpoint the complexity of all considered semantics.

Following the tradition of the ASPARTIX system, we present answer-set programming encodings for the main semantics of argumentation frameworks with collective attacks (also known as SETAFs). By that, we provide the first system dedicated to reasoning in SETAFs. Since to date, no known polynomial-time (with respect to the number of arguments) translation from SETAFs to Dung-style frame-works is known, genuine implementations for SETAFs appear necessary towards practically efficient systems for this particular formalism. As a by-product, we in-troduce semi-stable and stage semantics for SETAFs and pinpoint the complexity of all considered semantics.

bstract argumentation, answer-set programming, collective attacks, SETAF

https://publik.tuwien.ac.at/files/publik_272916.pdf

Projektleitung Stefan Woltran:
Neue Werkzeuge für graphenbasierte formale Argumentation

Projektleitung Stefan Woltran:
START