Talks and Poster Presentations (with Proceedings-Entry):

M. Kröll, R. Pichler, S. Woltran:
"On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks";
Talk: 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia; 2017-08-19 - 2017-08-25; in: "Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017", (2017), 1145 - 1152.

English abstract:
Several computational problems of abstract argumentation frameworks (AFs) such as skeptical and credulous reasoning, existence of a non-empty extension, verification, etc. have been thoroughly analyzed for various semantics. In contrast, the enumeration problem of AFs (i.e., the problem of computing all extensions according to some semantics) has been left unexplored so far. The goal of this paper is to fill this gap. We thus investigate the enumeration complexity of AFs for a large collection of semantics and, in addition, consider the most common structural restrictions on AFs.

Knowledge Representation; Reasoning; Logic; Computational; models; Argument;

"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)

Related Projects:
Project Head Reinhard Pichler:
Effiziente, parametrisierte Algorithmen in Künstlicher Intelligenz und logischem Schließen

Project Head Reinhard Pichler:
Heterogene Information Integration

Project Head Stefan Woltran:
Neue Werkzeuge für graphenbasierte formale Argumentation

Created from the Publication Database of the Vienna University of Technology.