Abstract
Extension-based argumentation semantics is a successful approach for performing non-monotonic reasoning based on argumentation theory. An interesting property of some extension-based argumentation semantics is that these semantics can be characterized in terms of logic programming semantics. In this paper, we present novel results in this topic. In particular, we show that one can induce an argumentation semantics (that we call Stratified Argumentation Semantics) based on a logic programming semantics that is based on stratified minimal models. We show that the stratified argumentation semantics overcome some problems of extension-based argumentation semantics based on admissible sets and we show that it coincides with the argumentation semantics CF2.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer, Heidelberg (2008)
Baroni, P., Giacomin, M., Guida, G.: SCC-recursiveness: a general schema for argumentation semantics. Artificial Intelligence 168, 162–210 (2005)
Bench-Capon, T.J.M., Dunne, P.E.: Argumentation in artificial intelligence. Artificial Intelligence 171(10-15), 619–641 (2007)
Carballido, J.L., Nieves, J.C., Osorio, M.: Inferring Preferred Extensions by Pstable Semantics. Iberoamerican Journal of Artificial Intelligence (Inteligencia Artificial) 13(41), 38–53 (2009)
Dix, J., Müller, M.: Partial evaluation and relevance for approximations of stable semantics. In: Raś, Z.W., Zemankova, M. (eds.) ISMIS 1994. LNCS, vol. 869, pp. 511–520. Springer, Heidelberg (1994)
Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77(2), 321–358 (1995)
Dunne, P.E., Bench-Capon, T.J.: Coherence in finite argument systems. Artificial Intelligence 141(1), 187–203 (2002)
Gelder, A.V., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. Journal of the ACM 38(3), 620–650 (1991)
Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: Kowalski, R., Bowen, K. (eds.) 5th Conference on Logic Programming, pp. 1070–1080. MIT Press, Cambridge (1988)
Kakas, A.C., Kowalski, R.A., Toni, F.: The role of abduction in logic programming. In: Gabbay, D., Hogger, C.J., Robinson, J.A. (eds.) Handbook in Artificial Intelligence and Logic Programming, vol. 5, pp. 235–324. Oxford University Press, Oxford (1998)
Kakas, A.C., Mancarella, P.: Generalized stable models: A semantics for abduction. In: ECAI, pp. 385–391 (1990)
Nieves, J.C.: Modeling arguments and uncertain information — A non-monotonic reasoning approach. PhD thesis, Software Department (LSI), Technical University of Catalonia (2008)
Nieves, J.C., Osorio, M.: A General Schema For Generating Argumentation Semantics From Logic Programming Semantics. Research Report LSI-08-32-R, Technical University of Catalonia, Software Department, LSI (2008), http://www.lsi.upc.edu/dept/techreps/buscar.php
Nieves, J.C., Osorio, M., Cortés, U.: Preferred Extensions as Stable Models. Theory and Practice of Logic Programming 8(4), 527–543 (2008)
Nieves, J.C., Osorio, M., Cortés, U., Olmos, I., Gonzalez, J.A.: Defining new argumentation-based semantics by minimal models. In: Seventh Mexican International Conference on Computer Science (ENC 2006), pp. 210–220. IEEE Computer Society Press, Los Alamitos (2006)
Osorio, M., Navarro, J.A., Arrazola, J.R., Borja, V.: Logics with Common Weak Completions. Journal of Logic and Computation 16(6), 867–890 (2006)
Prakken, H., Vreeswijk, G.A.W.: Logics for defeasible argumentation. In: Gabbay, D., Günthner, F. (eds.) Handbook of Philosophical Logic, 2nd edn., vol. 4, pp. 219–318. Kluwer Academic Publishers, Dordrecht (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nieves, J.C., Osorio, M., Zepeda, C. (2009). Expressing Extension-Based Semantics Based on Stratified Minimal Models. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2009. Lecture Notes in Computer Science(), vol 5514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02261-6_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-02261-6_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02260-9
Online ISBN: 978-3-642-02261-6
eBook Packages: Computer ScienceComputer Science (R0)