×

Logical modes of attack in argumentation networks. (English) Zbl 1185.68671

Summary: This paper studies methodologically robust options for giving logical contents to nodes in abstract argumentation networks. It defines a variety of notions of attack in terms of the logical contents of the nodes in a network. General properties of logics are refined both in the object level and in the metalevel to suit the needs of the application. The network-based system improves upon some of the attempts in the literature to define attacks in terms of defeasible proofs, the so-called rule-based systems. We also provide a number of examples and consider a rigorous case study, which indicate that our system does not suffer from anomalies. We define consequence relations based on a notion of defeat, consider rationality postulates, and prove that one such consequence relation is consistent.

MSC:

68T27 Logic in artificial intelligence

References:

[1] Alchourron C.E., Gardenfors P., Makinson D.C.: ’On the Logic of Theory Change: Partial Meet Contraction and Revision Functions’. The Journal of Symbolic Logic 50, 510–530 (1985) · Zbl 0578.03011 · doi:10.2307/2274239
[2] Barringer, H., D. M. Gabbay, and J. Woods, ’Temporal Dynamics of Support and Attack Networks: From Argumentation to Zoology’, in D. Hutter and W. Stephan (eds.), Mechanising Mathematical Reasoning, LNCS 2605: 59–98, Springer, 2005. · Zbl 1098.68122
[3] Besnard, P., and A. B. Hunter, Elements of Argumentation, MIT Press, 2008.
[4] Caminada M.W.A., Amgoud L.: ’On the evaluation of argumentation formalisms’. Artificial Intelligence 171(5–6), 286–310 (2007) · Zbl 1168.68562 · doi:10.1016/j.artint.2007.02.003
[5] d’Avila Garcez, A. S., K. Broda, and D. M. Gabbay, Neural-Symbolic Learning Systems: Foundations and Applications, Springer, 2002. · Zbl 1055.68090
[6] d’Avila Garcez, D. M. Gabbay, and L. C. Lamb, ’Value-based Argumentation Frameworks as Neural-Symbolic Learning Systems’, Journal of Logic and Computation 15(6): 1041-1058 December 2005. · Zbl 1144.68375
[7] d’Avila Garcez, and D. M. Gabbay, ’Fibring Neural Networks’, in Proc. 19th National Conference on Artificial Intelligence AAAI 2004, San Jose, California, USA, AAAI Press, July 2004.
[8] d’Avila Garcez, L. C. Lamb, and D.M. Gabbay, Neural-Symbolic Cognitive Reasoning, Springer, 2008. · Zbl 1188.68241
[9] Gabbay, D. M., Labelled Deductive Systems, OUP, 1996.
[10] Gabbay D.M., Reyle U.: ’N-Prolog: An Extension of Prolog with Hypothetical Implications’. Journal of Logic Programming 1(4), 319–355 (1984) · Zbl 0576.68001 · doi:10.1016/0743-1066(84)90029-3
[11] Gabbay, D. M., Fibring Logics, OUP, 1998.
[12] Gabbay D.M., Woods J.: ’Resource origins of non-monotonicity’. Studia Logica 88(1), 85–112 (2008) · Zbl 1149.03006 · doi:10.1007/s11225-008-9100-2
[13] Gomez Lucero, M. J., C. I. Chesnevar and G. R. Simari, ’On the Accrual of Arguments in Defeasible Logic Programming’, in Proc. 21st Intl. Joint Conference on Artificial Intelligence IJCAI 2009, Pasadena, USA, July 2009 (in press).
[14] Leitgeb, H., ’Neural network models of conditionals: an introduction’, in X. Arrazola, J. M. Larrazabal et al. (eds.), Proc. ILCLI International Workshop on Logic and Philosophy of Knowledge, Communication and Action, 191-223, Bilbao, 2007.
[15] Pollock J.: ’Self-defeating Arguments’. Minds and Machines 1(4), 367–392 (1991) · doi:10.1007/BF00352916
[16] Verheij, B., ’Accrual of arguments in defeasible argumentation’, in Proc. 2nd Dutch/German Workshop on Nonmonotonic Reasoning, Utrecht, 217–224, 1995.
[17] Prakken H., Sartor G.: ’Argument based extended logic programming with defeasible priorities’. Joural of Applied Non-classical Logics 7, 25–75 (1997) · Zbl 0877.68019
[18] Stenning, K., and M. van Lambalgen, Human reasoning and cognitive science, MIT Press, 2008.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.