Abstract
In this paper we introduce a logic of abstract argumentation capturing Dung’s theory of abstract argumentation, based on connectives for attack and defend. We extend it to a modal logic of abstract argumentation to generalize Dung’s theory and define variants of it. Moreover, we use the logic to relate Dung’s theory of abstract argumentation to more traditional conditional and comparative formalisms, and we illustrate how to reason about arguments in meta-argumentation.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Besnard, P., Doutre, S.: Checking the acceptability of a set of arguments. In: Procs. of NMR 2004, pp. 59–64 (2004)
Bochman, A.: Collective argumentation and disjunctive logic programming. Journal of Logic and Computation 13, 405–428 (2003)
Bochman, A.: A causal approach to nonmonotonic reasoning. Artificial Intelligence 160(1-2), 105–143 (2004)
Bochman, A.: A causal logic of logic programming. In: Procs. of KR 2004, pp. 427–437 (2004)
Bochman, A.: Propositional argumentation and causal reasoning. In: Procs. of IJCAI 1995, pp. 388–393 (2005)
Bondarenko, A., Dung, P., Kowalski, R., Toni, F.: An abstract, argumentation based approach to default reasoning. Artificial Intelligence 93(1–2), 63–101 (1997)
Dung, P.: On the acceptability of arguments and its fundamental role in non-monotonic reasoning, logic programming and n-person games. Artificial Intelligence 76, 321–358 (1995)
Hemaspaandra, E.: The price of universality. Notre Dame Journal of Formal Logic 37(2), 174–203 (1996)
Horty, J.: Argument construction and reinstatement in logics for defeasible reasoning. Artificial Intelligence and Law 9, 1–28 (2001)
Makinson, D., van der Torre, L.: Input-output logics. Journal of Philosophical Logic 29, 383–408 (2000)
Makinson, D., van der Torre, L.: Constraints for input-output logics. Journal of Philosophical Logic 30(2), 155–185 (2001)
Parsons, S.D., Sierra, C., Jennings, N.R.: Agents that reason and negotiate by arguing. Journal of Logic and Computation 8(3), 261–292 (1998)
Prakken, H., Sartor, G.: Modelling reasoning with precedents in a formal dialogue game. Artificial Intelligence and Law 6, 231–287 (1998)
Prakken, H., Vreeswijk, G.: Logics for defeasible argumentation. In: Gabbay, D., Guenthner, F. (eds.) Handbook of philosophical logic, pp. 218–319. Kluwer, Dordrecht (2002)
Verheij, B.: Accrual of arguments in defeasible argumentation. In: Proceedings of the Second Dutch/German Workshop on Nonmonotonic Reasoning, pp. 217–224 (1995)
Von Wright, G.H.: The Logic of Preference: an Essay. Edinburgh University Press (1963)
Walton, C.: Model checking agent dialogues. In: Leite, J.A., Omicini, A., Torroni, P., Yolum, p. (eds.) DALT 2004. LNCS (LNAI), vol. 3476, pp. 132–147. Springer, Heidelberg (2005)
Wooldridge, M., McBurney, P., Parsons, S.: On the meta-logic of arguments. In: Proceedings of AAMAS 2005, pp. 560–567 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boella, G., Hulstijn, J., van der Torre, L. (2006). A Logic of Abstract Argumentation. In: Parsons, S., Maudet, N., Moraitis, P., Rahwan, I. (eds) Argumentation in Multi-Agent Systems. ArgMAS 2005. Lecture Notes in Computer Science(), vol 4049. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11794578_2
Download citation
DOI: https://doi.org/10.1007/11794578_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36355-2
Online ISBN: 978-3-540-36356-9
eBook Packages: Computer ScienceComputer Science (R0)