Abstract
In the current paper, we re-examine how abstract argumentation can be formulated in terms of labellings, and how the resulting theory can be applied in the field of modal logic. In particular, we are able to express the (complete) extensions of an argumentation framework as models of a set of modal logic formulas that represents the argumentation framework. Using this approach, it becomes possible to define the grounded extension in terms of modal logic entailment.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Amgoud, L., N. Maudet, and S. Parsons, ‘Modelling dialogues using argumentation’, Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-00), Boston, MA, 2000, pp. 31–38.
ASPIC-consortium, Deliverable D2.5: Draft formal semantics for ASPIC system, June 2005.
Baroni, P., and M. Giacomin, ‘Comparing argumentation semantics with respect to skepticism’, Proc. ECSQARU 2007, 2007, pp. 210–221.
P. Baroni, Giacomin M.: ‘On principle-based evaluation of extension-based argumentation semantics’. Artificial Intelligence 171(10-15), 675–700 (2007)
Besnard, Ph., and S. Doutre, ‘Characterization of semantics for argument systems’, Proceedings of the Ninth International Conference on the principles of Knowledge Representation and reasoning, AAAI Press, 2004, pp. 183–193.
Boella, G., J. Hulstijn, and L. van der Torre, ‘A logic of abstract argumentation’, Proceedings of the Workshop on Argumentation in Multi-Agent Systems (ArgMAS), 2005.
Caminada, M.W.A., ‘On the issue of reinstatement in argumentation’, in M. Fischer, W. van der Hoek, B. Konev, and A. Lisitsa (eds.), Logics in Artificial Intelligence; 10th European Conference, JELIA 2006, LNAI 4160, Springer, 2006, pp. 111–123.
Caminada, M.W.A., On the issue of reinstatement in argumentation, Technical Report UU-CS-2006-023, Institute of Information and Computing Sciences, Utrecht University, 2006.
Caminada, M.W.A., ‘Semi-stable semantics’, in P. E. Dunne and T. J. M. Bench- Capon (eds.), Computational Models of Argument; Proceedings of COMMA 2006, IOS Press, 2006, pp. 121–130.
Caminada, M.W.A., `An algorithm for computing semi-stable semantics’, Proceedings of the 9th European Conference on Symbolic and Quantitalive Approaches to Reasoning with Uncertainty (ECSQARU 2007), number 4724 Springer Lecture Notes in AI, Springer Verlag, Berlin, 2007, pp. 222–234.
Caminada M.W.A., Amgoud L.: ‘On the evaluation of argumentation formalisms’. Artificial Intelligence 171(5-6), 286–310 (2007)
Dung P.M.: ‘On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games’. Artificial Intelligence 77, 321–357 (1995)
Dung M.P., Mancarella P., Toni F.: ‘Computing ideal sceptical argumentation’. Artificial Intelligence 171(10-15), 642–674 (2007)
Gabbay, D. M., ‘Fibring argumentation frames’, Studia Logica 93 (2-3): 231–295, 2009, this issue.
Gabbay D.M.: ‘Modal provability foundations for argumentation networks’. Studia Logica 93(2-3), 181–198 (2009) this issue
Gabbay D.M., d’Avila Garcez A.S.: ‘Logical modes of attack in argumentation networks’. Studia Logica 93(2-3), 199–230 (2009) this issue
Gabbay, D. M., A. Kurucz, F. Wolter, and M. Zakharyaschev, Many dimensional Modal Logics: Theory and Applications, Number 148 Studies in Logic and the Foundations of Mathematics Elsevier, 2003.
Gabbay, D. M., R. Schmidt, and A. Szałas, Order Quantifier Elmination, College Publications, 2008.
Grossi, D., Doing argumentation theory in modal logic, Technical Report PP-2009- 24, ILLC, 2009.
Jakobovits H., Vermeir D.: ‘Robust semantics for argumentation frameworks’. Journal of logic and computation 9(2), 215–261 (1999)
Pollock, J. L., Cognitive Carpentry. A Blueprint for How to Build a Person, MIT Press, Cambridge, MA, 1995.
Prakken H., Sartor G.: ‘Argument-based extended logic programming with defeasible priorities’. Journal of Applied Non-Classical Logics 7, 25–75 (1997)
Rahwan I., Zablith F., Reed C.: ‘Laying the foundations for a world wide argument web’. Artificial Intelligence 171(10-15), 897–921 (2007)
Simari G. R., Loui R. P.: ‘A mathematical treatment of defeasible reasoning and its implementation’. Artificial Intelligence 53, 125–157 (1992)
Smorynski, C., ‘Modal logic and self reference’, in D. M. Gabbay and F. Guenter (eds.), Handbook of Philosophical Logic, 1st edition, volume 2. Kluwer, 1984.
Verheij, B., ‘A labeling approach to the computation of credulous acceptance in argumentation’, in M. M. Veloso (ed.), Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, 2007, pp. 623–628.
Vreeswijk, G. A. W., Studies in defeasible argumentation, PhD thesis at Free University of Amsterdam, 1993.
Vreeswijk, G. A. W., ‘An algorithm to compute minimally grounded and admissible defence sets in argument systems’, in P. E. Dunne and T. J. M. Bench-Capon (eds.), Computational Models of Argument; Proceedings of COMMA 2006, IOS, 2006, pp. 109–120.
Wu Y., Caminada M., Gabbay D.M.: ‘Complete extensions in argumentation coincide with 3-valued stable models in logic programming’. Studia Logica 93(2-3), 383–403 (2009) this issue
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Caminada, M.W.A., Gabbay, D.M. A Logical Account of Formal Argumentation. Stud Logica 93, 109 (2009). https://doi.org/10.1007/s11225-009-9218-x
Published:
DOI: https://doi.org/10.1007/s11225-009-9218-x