Graduate studies at Western
Argument and Computation 1 (2):147-177 (2011)
|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|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Gerhard Brewka (2005). Answer Sets and Qualitative Decision Making. Synthese 146 (1-2):171 - 187.
Jean-Gabriel Ganascia (2007). Modelling Ethical Rules of Lying with Answer Set Programming. Ethics and Information Technology 9 (1):39-47.
Yining Wu, Martin Caminada & Dov M. Gabbay (2009). Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic Programming. Studia Logica 93 (2/3):383 - 403.
David Pearce & Agustín Valverde (2005). A First Order Nonmonotonic Extension of Constructive Logic. Studia Logica 80 (2-3):321 - 346.
Added to index2010-08-11
Total downloads8 ( #131,939 of 740,413 )
Recent downloads (6 months)0
How can I increase my downloads?