On the intertranslatability of argumentation semantics

Journal of Artificial Intelligence Research

Volumn 41, Issue , 2011, Pages 445-475

  Dvořák, Wolfgang ^a   Woltran, Stefan ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT ARGUMENTATION; ARGUMENTATION SEMANTICS; COMPLEXITY RESULTS; NONMONOTONIC;

KNOWLEDGE REPRESENTATION;

SEMANTICS;

EID: 80053430344     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.3318     Document Type: Article

References (41)

1. Amgoud, L., Dimopoulos, Y., & Moraitis, P. (2007). A unified and general framework for argumentation-based negotiation. In Durfee, E. H., Yokoo, M., Huhns, M. N., & Shehory, O. (Eds.), Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), pp. 963-970. IFAAMAS.
2. Baroni, P., Dunne, P. E., & Giacomin, M. (2011). On the resolution-based family of abstract argumentation semantics and its grounded instance. Artif. Intell., 175 (3-4), 791-813.
3. Baroni, P., Cerutti, F., Giacomin, M., & Guida, G. (2011). AFRA: Argumentation framework with recursive attacks. Int. J. Approx. Reasoning, 52 (1), 19-37.
4. Baroni, P., & Giacomin, M. (2009). Semantics of abstract argument systems. In Rahwan, I., & Simari, G. (Eds.), Argumentation in Artificial Intelligence, pp. 25-44. Springer.
5. Baroni, P., Giacomin, M., & Guida, G. (2005). SCC-recursiveness: A general schema for argumentation semantics. Artif. Intell., 168 (1-2), 162-210. (Pubitemid 41338774)
6. Baumann, R., & Brewka, G. (2010). Expanding argumentation frameworks: Enforcing and monotonicity results. In Baroni, P., Cerutti, F., Giacomin, M., & Simari, G. R. (Eds.), Proceedings of the 3rd Conference on Computational Models of Argument (COMMA 2010), Vol. 216 of Frontiers in Artificial Intelligence and Applications, pp. 75-86. IOS Press.
7. Bench-Capon, T. J. M., & Atkinson, K. (2009). Abstract argumentation and values. In Rahwan, I., & Simari, G. (Eds.), Argumentation in Artificial Intelligence, pp. 45-64. Springer.
8. Bench-Capon, T. J. M., & Dunne, P. E. (2005). Argumentation in AI and law: Editors' introduction. Artif. Intell. Law, 13 (1), 1-8. (Pubitemid 44198323)
9. Besnard, P., & Hunter, A. (2001). A logic-based theory of deductive arguments. Artif. Intell., 128, 203-235. (Pubitemid 32421514)
10. Brewka, G., Dunne, P. E., & Woltran, S. (2011). Relating the semantics of abstract dialectical frameworks and standard AFs. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 780-785. AAAI Press.
11. Caminada, M. (2006). Semi-stable semantics. In Dunne, P. E., & Bench-Capon, T. J. M. (Eds.), Proceedings of the 1st Conference on Computational Models of Argument (COMMA 2006), Vol. 144 of Frontiers in Artificial Intelligence and Applications, pp. 121-130. IOS Press.
12. Caminada, M., & Amgoud, L. (2007). On the evaluation of argumentation formalisms. Artif. Intell., 171 (5-6), 286-310. (Pubitemid 46560479)
13. Caminada, M., & Gabbay, D. (2009). A logical account of formal argumentation. Studia Logica, 93 (2), 109-145.
14. Cayrol, C., & Lagasquie-Schiex, M. (2009). Bipolar abstract argumentation systems. In Rahwan, I., & Simari, G. (Eds.), Argumentation in Artificial Intelligence, pp. 65-84. Springer.
15. Coste-Marquis, S., Devred, C., & Marquis, P. (2005). Symmetric argumentation frameworks. In Godo, L. (Ed.), Proceedings of the 8th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2005), Vol. 3571 of Lecture Notes in Computer Science, pp. 317-328. Springer.
16. de Bruijn, J., Eiter, T., & Tompits, H. (2008). Embedding approaches to combining rules and ontologies into autoepistemic logic. In Brewka, G., & Lang, J. (Eds.), Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR2008), pp. 485-495. AAAI Press.
17. Delgrande, J. P., & Schaub, T. (2005). Expressing default logic variants in default logic. J. Log. Comput., 15 (5), 593-621. (Pubitemid 41426699)
18. Denecker, M., Marek, W., & Truszczyński, M. (2003). Uniform semantic treatment of default and autoepistemic logics. Artif. Intell., 143 (1), 79-122.
19. Dimopoulos, Y., & Torres, A. (1996). Graph theoretical structures in logic programs and default theories. Theor. Comput. Sci., 170 (1-2), 209-244. (Pubitemid 126411634)
20. Dung, P. M. (1995). On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell., 77 (2), 321-358.
21. Dung, P. M., Mancarella, P., & Toni, F. (2007). Computing ideal sceptical argumentation. Artif. Intell., 171 (10-15), 642-674. (Pubitemid 47285080)
22. Dunne, P. E., & Bench-Capon, T. J. M. (2002). Coherence in finite argument systems. Artif. Intell., 141 (1/2), 187-203.
23. Dunne, P. E., & Caminada, M. (2008). Computational complexity of semi-stable semantics in abstract argumentation frameworks. In Ho¨lldobler, S., Lutz, C., & Wansing, H. (Eds.), Proceedings of the 11th European Conference on Logics in Artificial Intelligence (JELIA 2008), Vol. 5293 of Lecture Notes in Computer Science, pp. 153-165. Springer.
24. Dvořák, W., & Woltran, S. (2010). Complexity of semi-stable and stage semantics in argumentation frameworks. Inf. Process. Lett., 110 (11), 425-430.
25. Gabbay, D. M. (2009). Fibring argumentation frames. Studia Logica, 93 (2-3), 231-295.
26. Gabbay, D. M. (2011). Equational approach to argumentation networks. Unpublished draft.
27. Gottlob, G. (1995). Translating default logic into standard autoepistemic logic. J. ACM, 42 (4), 711-740.
28. Imielinski, T. (1987). Results on translating defaults to circumscription. Artif. Intell., 32 (1), 131-146.
29. Janhunen, T. (1999). On the intertranslatability of non-monotonic logics. Ann. Math. Artif. Intell., 27 (1-4), 79-128.
30. Janhunen, T., Niemelä, I., Seipel, D., Simons, P., & You, J.-H. (2006). Unfolding partiality and disjunctions in stable model semantics. ACM Trans. Comput. Log., 7 (1), 1-37. (Pubitemid 43924967)
31. Konolige, K. (1988). On the relation between default and autoepistemic logic. Artif. Intell., 35 (3), 343-382.
32. Liberatore, P. (2007). Bijective faithful translations among default logics. CoRR, abs/0707.3781.
33. Marek,W., & Truszczyński,M. (1993). Nonmonotonic Logic: Context Dependent Reasoning. Springer.
34. Modgil, S. (2009). Reasoning about preferences in argumentation frameworks. Artif. Intell., 173 (9-10), 901-934.
35. Modgil, S., & Bench-Capon, T. J. M. (2011). Metalevel argumentation. Accepted for publication in J. Log. Comput.. Available at http://dx.doi.org/doi: 10.1093/logcom/exq054.
36. Moore, R. C. (1985). Semantical considerations on nonmonotonic logic. Artif. Intell., 25, 75-94.
37. Pearce, D., & Uridia, L. (2011). The Go¨del and the splitting translations. Submitted Draft. Preliminary Version has been presented at the International Conference "30 Years of Nonmonotonic Logic".
38. Reiter, R. (1980). A logic for default reasoning. Artif. Intell., 13 (1-2), 81-132.
39. Verheij, B. (1996). Two approaches to dialectical argumentation: admissible sets and argumentation stages. In Meyer, J., & van der Gaag, L. (Eds.), Proceedings of the 8th Dutch Conference on Artificial Intelligence (NAIC'96), pp. 357-368.
40. Villata, S. (2010). Meta-Argumentation for Multiagent Systems: Coalition Formation, Merging Views, Subsumption Relation and Dependence Networks. Ph.D. thesis, Universita´ degli Studi di Torino.
41. Wu, Y., Caminada, M., & Gabbay, D. M. (2009). Complete extensions in argumentation coincide with 3-valued stable models in logic programming. Studia Logica, 93 (2-3), 383-403.