Hinweis
Dieser Eintrag wurde automatisch aus einem Altsystem migriert. Die Daten wurden nicht überprüft und entsprechen eventuell nicht den Qualitätskriterien des vorliegenden Systems.
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, ...
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.
en
Projekttitel:
Theoretical Tractability vs. Practical Computation (Fonds zur Förderung der wissenschaftlichen Forschung (FWF)) New Methods for Analyzing, Comparing, and Solving Argumentation Problems (WWTF Wiener Wissenschafts-, Forschu und Technologiefonds)