Argument and Computation 1 (2):147-177 (2011)
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
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Modelling Ethical Rules of Lying with Answer Set Programming.Jean-Gabriel Ganascia - 2007 - Ethics and Information Technology 9 (1):39-47.
A Reductive Semantics for Counting and Choice in Answer Set Programming.Vladimir Lifschitz - unknown
Added to index2010-08-11
Total downloads20 ( #244,864 of 2,158,463 )
Recent downloads (6 months)1 ( #354,692 of 2,158,463 )
How can I increase my downloads?