Within the last years, especially since the work proposed by Dung in 1995, argumentation has emerged as a central issue in Artificial Intelligence. With the so called argumentation frameworks (AFs) it is possible to represent statements (arguments) together with a binary attack relation between them. The conflicts between the statements are solved on a semantical level by selecting acceptable sets of arguments. An increasing amount of data requires an automated computation of such solutions. Logic Programming in particular Answer-Set Programming (ASP) turned out to be adequate to solve problems associated to such AFs. In this work we use ASP to design a sophisticated system for the evaluation of several types of argumentation frameworks.
@InProceedings{gaggl:LIPIcs.ICLP.2010.265, author = {Gaggl, Sarah Alice}, title = {{Towards a General Argumentation System based on Answer-Set Programming}}, booktitle = {Technical Communications of the 26th International Conference on Logic Programming}, pages = {265--269}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-17-0}, ISSN = {1868-8969}, year = {2010}, volume = {7}, editor = {Hermenegildo, Manuel and Schaub, Torsten}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2010.265}, URN = {urn:nbn:de:0030-drops-26065}, doi = {10.4230/LIPIcs.ICLP.2010.265}, annote = {Keywords: Argumentation, Implementation, Answer-Set Programming} }
Feedback for Dagstuhl Publishing