cf2 Semantics Revisited
作者： Stefan Woltran , Sarah Alice Gaggl
DOI: 10.3233/978-1-60750-619-5-243
关键词:
摘要: Abstract argumentation frameworks nowadays provide the most popular formalization of on a conceptual level. Numerous semantics for this paradigm have been proposed, whereby cf2 has shown to nicely solve particular problems concernend with odd-length cycles in such frameworks. In order compare different not only theoretical basis, it is necessary systems which implement them within uniform platform. Answer-Set Programming (ASP) turned out be promising direction aim, since allows concise representation concepts inherent semantics, but also offers sophisticated off-the-shelves solvers can used as core computation engines. fact, many meanwhile encoded ASP paradigm, all relevant among yet considered. The contributions work are thus twofold. Due nature we first an alternative characterization which, roughly speaking, avoids recursive sub-frameworks. Then, concrete ASP-encodings, incorporated ASPARTIX system, platform already implements wide range abstract argumentation.
sci-hub.st 参考文章(13)
Juan Carlos Nieves, Mauricio Osorio, Claudia Zepeda, Expressing Extension-Based Semantics Based on Stratified Minimal Models workshop on logic language information and computation. pp. 305- 319 ,(2009) , 10.1007/978-3-642-02261-6_25
Paul E. Dunne, Michael Wooldridge, Complexity of Abstract Argumentation Applied Artificial Intelligence. pp. 85- 104 ,(2009) , 10.1007/978-0-387-98197-0_5
Martin WA Caminada, Walter A Carnielli, Paul E Dunne, Semi-Stable Semantics computational models of argument. pp. 121- 130 ,(2006)
Marc Denecker, Joost Vennekens, Stephen Bond, Martin Gebser, Mirosław Truszczyński, The Second Answer Set Programming Competition Logic Programming and Nonmonotonic Reasoning. pp. 637- 654 ,(2009) , 10.1007/978-3-642-04238-6_75
P.M. Dung, P. Mancarella, F. Toni, Computing ideal sceptical argumentation Artificial Intelligence. ,vol. 171, pp. 642- 674 ,(2007) , 10.1016/J.ARTINT.2007.05.003
Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, Francesco Scarcello, The DLV system for knowledge representation and reasoning ACM Transactions on Computational Logic. ,vol. 7, pp. 499- 562 ,(2006) , 10.1145/1149114.1149117
Michael Gelfond, Vladimir Lifschitz, Classical negation in logic programs and disjunctive databases New Generation Computing. ,vol. 9, pp. 365- 385 ,(1991) , 10.1007/BF03037169
Phan Minh Dung, On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n -person games Artificial Intelligence. ,vol. 77, pp. 321- 357 ,(1995) , 10.1016/0004-3702(94)00041-X
Pietro Baroni, Massimiliano Giacomin, Giovanni Guida, SCC-recursiveness: a general schema for argumentation semantics Artificial Intelligence. ,vol. 168, pp. 162- 210 ,(2005) , 10.1016/J.ARTINT.2005.05.006
Juan Carlos Nieves, Ulises Cortés, Mauricio Osorio, Preferred extensions as stable models Theory and Practice of Logic Programming. ,vol. 8, pp. 527- 543 ,(2008) , 10.1017/S1471068408003359