Answer-set programming encodings for argumentation frameworks

Argument and Computation 1 (2):147-177 (2010)
  Copy   BIBTEX

Abstract

Answer-set programming (ASP) has emerged as a declarative programming paradigm where problems are encoded as logic programs, such that the so-called answer sets of theses programs represent the solutions of the encoded problem. The efficiency of the latest ASP solvers reached a state that makes them applicable for problems of practical importance. Consequently, problems from many different areas, including diagnosis, data integration, and graph theory, have been successfully tackled via ASP. In this work, we present such ASP-encodings for problems associated to abstract argumentation frameworks (AFs) and generalisations thereof. Our encodings are formulated as fixed queries, such that the input is the only part depending on the actual AF to process. We illustrate the functioning of this approach, which is underlying a new argumentation system called ASPARTIX in detail and show its adequacy in terms of computational complexity

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,221

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Using criticalities as a heuristic for answer set programming.Orkunt Sabuncu, Ferda N. Alpaslan & Varol Akman - 2003 - In Vladimir Lifschitz & Ilkka Niemela (eds.), Logic Programming and Nonmonotonic Reasoning, Lecture Notes in Artificial Intelligence 2923 (7th International Conference, LPNMR 2004, Fort Lauderdale, FL, January 6-8, 2004 Proceedings). Berlin, Heidelberg: Springer. pp. 234-246.
Modelling ethical rules of lying with answer set programming.Jean-Gabriel Ganascia - 2007 - Ethics and Information Technology 9 (1):39-47.

Analytics

Added to PP
2010-08-11

Downloads
48 (#291,517)

6 months
2 (#658,848)

Historical graph of downloads
How can I increase my downloads?