ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Toggle side column

ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming

Uwe EglyUwe Egly,  Sarah Alice GagglSarah Alice Gaggl,  Stefan WoltranStefan Woltran
ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming


Uwe Egly, Sarah Alice Gaggl, Stefan Woltran
ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming
In Maria Garcia de la Banda, Enrico Pontelli, eds., Proceedings of the 24th International Conference on Logic Programming, (ICLP 2008), volume 5366 of Lecture Notes in Computer Science, 734-738, 2008. Springer
  • KurzfassungAbstract
    Thesystem ASPARTIX is a tool for computing acceptable extensions for a broad range of formalizations of Dung’s argumentation framework and generalizations thereof. ASPARTIX relies on a fixed disjunctive datalog program which takes an instance of an argumentation framework as input, and uses the answer-set solver DLV for computing the type of extension specified by the user.
  • Forschungsgruppe:Research Group: Computational Logic
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-89982-2.
@inproceedings{EGW2008,
  author    = {Uwe Egly and Sarah Alice Gaggl and Stefan Woltran},
  title     = {ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set
               Programming},
  editor    = {Maria Garcia de la Banda and Enrico Pontelli},
  booktitle = {Proceedings of the 24th International Conference on Logic
               Programming, (ICLP 2008)},
  series    = {Lecture Notes in Computer Science},
  volume    = {5366},
  publisher = {Springer},
  year      = {2008},
  pages     = {734-738},
  doi       = {10.1007/978-3-540-89982-2}
}