Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Inferring acceptable arguments with Answer Set Programming
ENC '05 Proceedings of the Sixth Mexican International Conference on Computer Science
SCC-recursiveness: a general schema for argumentation semantics
Artificial Intelligence
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Computing ideal sceptical argumentation
Artificial Intelligence
Preferred extensions as stable models*
Theory and Practice of Logic Programming
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Expressing Extension-Based Semantics Based on Stratified Minimal Models
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
The Second Answer Set Programming Competition
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Argumentation and answer set programming
Logic programming, knowledge representation, and nonmonotonic reasoning
Strong equivalence for argumentation semantics based on conflict-free sets
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Abstract argumentation via monadic second order logic
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
| Hi-index | 0.00 |
Abstract argumentation frameworks nowadays provide the most popular formalization of argumentation on a conceptual level. Numerous semantics for this paradigm have been proposed, whereby cf2 semantics has shown to nicely solve particular problems concernend with odd-length cycles in such frameworks. In order to compare different semantics not only on a theoretical basis, it is necessary to provide systems which implement them within a uniform platform. Answer-Set Programming (ASP) turned out to be a promising direction for this aim, since it not only allows for a concise representation of concepts inherent to argumentation semantics, but also offers sophisticated off-the-shelves solvers which can be used as core computation engines. In fact, many argumentation semantics have meanwhile been encoded within the ASP paradigm, but not all relevant semantics, among them cf2 semantics, have yet been considered. The contributions of this work are thus twofold. Due to the particular nature of cf2 semantics, we first provide an alternative characterization which, roughly speaking, avoids the recursive computation of sub-frameworks. Then, we provide the concrete ASP-encodings, which are incorporated within the ASPARTIX system, a platform which already implements a wide range of semantics for abstract argumentation.