Dr Martin Caminada

2022

• Baroni, P., Cerutti, F. and Giacomin, M. 2022. A generalized notion of consistency with applications to formal argumentation. In: Toni, . et al. eds. Computational Models of Argument., Vol. 353. Frontiers in Artificial Intelligence and Applications IOS Press, pp. 56-67., (10.3233/FAIA220141)
• Caminada, M., Harikrishnan, S. and Sá, S. 2022. Comparing logic programming and formal argumentation; the case of ideal and eager semantics. Argument and Computation 13(1), pp. 93-120. (10.3233/AAC-200528)
• Caminada, M. and Harikrishnan, M. 2022. Strong admissibility, a tractable algorithmic approach. Presented at: Fourth International Workshop on Systems and Algorithms for Formal Argumentation, Cardiff, Wales, 13 September 2022Proceedings of the Fourth International Workshop on Systems and Algorithms for Formal Argumentation. CEUR pp. 33-44.

2020

• Caminada, M. and Dunne, P. E. 2020. Minimal strong admissibility: a complexity analysis. Presented at: 8th International Conference on Computational Models of Argument (COMMA 2020), Perugia, Italy, 4-11 September 2020.
• Caminada, M. and Uebis, S. 2020. An implementation of argument-based discussion using aspic. Presented at: 8th International Conference on Computational Models of Argument (COMMA 2020), Perugia, Italy, 4-11 September 2020.

2019

• Caminada, M. and Dunne, P. 2019. Strong admissibility revisited: theory and applications. Argument and Computation 10(3), pp. 277-300. (10.3233/AAC-190463)

2018

• Caminada, M. and Schulz, C. 2018. On the equivalence between assumption-based argumentation and logic programming (extended abstract). Presented at: IJCAI-ECAI-18, Stockholm, 13-19 July 2018.

2017

• Awad, E., Caminada, M. W. A., Pigozzi, G., Podlaszewski, M. and Rahwan, I. 2017. Pareto optimality and strategy-proofness in group argument evaluation. Journal of Logic and Computation 27(8), pp. 2581-2609. (10.1093/logcom/exx017)
• Caminada, M. and Schulz, C. 2017. On the equivalence between assumption-based argumentation and logic programming. Journal of Artificial Intelligence Research 60, pp. 779-825. (10.1613/jair.5581)
• Caminada, M. 2017. Rationality postulates: applying argumentation theory for non-monotonic reasoning. Journal of Applied Logics 4(8), pp. 2707-2734.
• Awad, E., Bonnefon, J., Caminada, M. and Rahwan, I. 2017. Experimental assessment of aggregation principles in argumentation-enabled collective intelligence. ACM Transactions on Internet Technology 17(3), article number: 29. (10.1145/3053371)
• Caminada, M. 2017. Argumentation semantics as formal discussion. In: Gabbay, D. et al. eds. Handbook of Formal Argumentation, Volume 1. College Publications
• Caminada, M. 2017. Rationality postulates: applying argumentation theory for non-monotonic reasoning. In: Gabbay, D. et al. eds. Handbook of Formal Argumentation, Volume 1. College Publications
• Caminada, M. 2017. Argumentation semantics as formal discussion. Journal of Applied Logics 4(8), pp. 2457-2492.

2016

• Caminada, M. W. A., Dvořák, W. and Vesic, S. 2016. Preferred semantics as Socratic discussion. Journal of Logic and Computation 26(4), pp. 1257-1292. (10.1093/logcom/exu005)
• Caminada, M. and Booth, R. 2016. A dialectical approach for argument-based judgment aggregation. Presented at: 6th International Conference on Computational Models of Argument (COMMA 2016), Potsdam, Germany, 13-16 September 2016 Presented at Baroni, P. et al. eds.Computational Models of Argument, Vol. 287. Frontiers in Artificial Intelligence and Applications IOS Press pp. 179-190., (10.3233/978-1-61499-686-6-179)

2015

• Caminada, M., Sá, S., Alcântara, J. and Dvořák, W. 2015. On the difference between assumption-based argumentation and abstract argumentation. IfCoLog Journal of Logic and its Applications 2(1), pp. 15-34.
• Caminada, M. and Giacomin, M. 2015. Introducing the special issue on 20 Years of argument-based inference. Journal of Logic and Computation 25(2), pp. 243-249. (10.1093/logcom/exu059)
• Sakama, C., Caminada, M. and Herzig, A. 2015. A formal account of dishonesty. Logic Journal of the IGPL 23(2), pp. 259-294. (10.1093/jigpal/jzu043)
• Caminada, M., Sa, S., Alcantara, J. and Dvorak, W. 2015. On the equivalence between logic programming semantics and argumentation semantics. International Journal of Approximate Reasoning 58, pp. 87-111. (10.1016/j.ijar.2014.12.004)
• Caminada, M. 2015. A discussion game for grounded semantics. Presented at: 3rd International Workshop on Theory and Applications of Formal Argumentation, Buenos Aires, Argentina, 25-26 July 2015 Presented at Black, E., Modgil, S. and Oren, N. eds.Theory and Applications of Formal Argumentation: Third International Workshop, TAFA 2015, Buenos Aires, Argentina, July 25-26, 2015, Revised Selected Papers, Vol. 9524. Lecture Notes in Computer Science Springer pp. 59-73., (10.1007/978-3-319-28460-6_4)
• Caminada, M. and Schulz, C. 2015. On the equivalence between assumption-based argumentation and logic programming. Presented at: The 1st International Workshop on Argumentation and Logic Programming (ArgLP 2015), Cork, Ireland, 31 August 2015.
• Caminada, M. and Sakama, C. 2015. On the issue of argumentation and informedness. Presented at: 2nd International Workshop on Argument for Agreement and Assurance (AAA 2015), Kanagawa, Japan, 17 November 2015.

2014

• Booth, R., Caminada, M., Dunne, P. E., Podlaszewski, M. and Rahwan, I. 2014. Complexity properties of critical sets of arguments. In: Parsons, S. et al. eds. Computational Models of Argument: Proceedings of COMMA 2014., Vol. 266. IOS Press, pp. 173-184.
• Booth, R., Caminada, M., Paul, D., Mikolaj, P. and Iyad, R. 2014. Complexity properties of critical sets of arguments. Presented at: 6th International Conference on Computational Models of Argument, Pitlochry, UK, 9-12 September 2014.
• Caminada, M., Modgil, S. and Oren, N. 2014. Preferences and unrestricted rebut. In: Computational Models of Argument. Frontiers in Artificial Intelligence and Applications Vol. 266. IOS Press, pp. 209-220.
• Caminada, M. 2014. Strong admissibility revisited. In: Parsons, S. et al. eds. Computational Models of Argument., Vol. 266. Frontiers in Artificial Intelligence and Applications IOS Press, pp. 197-208., (10.3233/978-1-61499-436-7-197)
• Caminada, M. and Oren, N. 2014. Grounded semantics and infinitary argumentation frameworks. Presented at: The 26th Benelux Conference on Artificial Intelligence, Nijmegen, The Netherlands, 6-7 November 2014.

2013

• Arieli, O. and Caminada, M. 2013. A QBF-based formalization of abstract argumentation semantics. Journal of Applied Logic 11(2), pp. 229-252. (10.1016/j.jal.2013.03.009)

2012

• Caminada, M., Carnielli, W. A. and Dunne, P. E. 2012. Semi-stable semantics. Journal of Logic and Computation 22(5), pp. 1207-1254.
• Arieli, O. and Caminada, M. 2012. A general QBF-based formalization of abstract argumentation theory. In: Verheij, B., Szeider, S. and Woltran, S. eds. Computational Models of Argument. Frontiers in Artificial Intelligence and Applications Vol. 245. IOS Press, pp. 105-116., (10.3233/978-1-61499-111-3-105)
• Caminada, M. and Podlaszewski, M. 2012. Grounded semantics as persuasion dialogue. Computational Models of Argument 245, pp. 478-485.

2011

• Baroni, P., Caminada, M. and Giacomin, M. 2011. An introduction to argumentation semantics. Knowledge Engineering Review 26(4), pp. 365-410. (10.1017/S0269888911000166)
• Caminada, M. and Pigozzi, G. 2011. On judgment aggregation in abstract argumentation. Autonomous Agents and Multi-Agent Systems 22(1), pp. 64-102. (10.1007/s10458-009-9116-7)

2010

• Caminada, M. 2010. An algorithm for stage semantics. In: Baroni, P. et al. eds. Computational Models of Argument: Proceedings of COMMA 2010., Vol. 216. Frontiers in Artificial Intelligence and Applications IOS Press, pp. 147-158., (10.3233/978-1-60750-619-5-147)
• Sakama, C., Caminada, M. and Herzig, A. 2010. A logical account of lying. Lecture Notes in Computer Science 6341, pp. 286-299. (10.1007/978-3-642-15675-5_25)

2009

• Caminada, M. and Wu, Y. 2009. An argument game for stable semantics. Logic Journal of the IGPL 17(1), pp. 77-90. (10.1093/jigpal/jzn029)

2008

• Dunne, P. E. and Caminada, M. 2008. Computational complexity of semi-stable semantics in abstract argumentation frameworks. Presented at: JELIA 2008, Dresden, Germany, 28 Sep - 1 Oct 2008 Presented at Hölldobler, S., Lutz, C. and Wansing, H. eds.Logics in Artifical Intelligence. Vol. 5293. Berlin: Springer Verlag pp. 153-165., (10.1007/978-3-540-87803-2_14)
• Caminada, M. 2008. On the issue of contraposition of defeasible rules. Presented at: COMMA 2008, Toulouse, France, 28-30 May 2008 Presented at Besnard, P., Doutre, S. and Hunter, A. eds.Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008, Vol. 172. Amsterdam: IOS Press pp. 109-115.

2007

• Caminada, M. and Amgoud, L. 2007. On the evaluation of argumentation formalisms. Artificial Intelligence 171(5-6), pp. 286-310. (10.1016/j.artint.2007.02.003)
• Caminada, M. 2007. An algorithm for computing semi-stable semantics. Lecture Notes in Computer Science 4724, pp. 222-234. (10.1007/978-3-540-75256-1_22)

2006

• Caminada, M. 2006. On the issue of reinstatement in argumentation. Lecture Notes in Computer Science 4160, pp. 111-123. (10.1007/11853886_11)
• Caminada, M. and Sakama, C. 2006. On the existence of answer sets in normal extended logic programs. Presented at: ECAI 2006: 17th European Conference on Artificial Intelligence, Riva del Garda, Italy, 29 Aug-1 Sept 2006 Presented at Brewka, G. et al. eds.ECAI 2006: 17th European Conference on Artificial Intelligence., August 29 - Spetember 1, Riva del Garda, Italy, Vol. 141. Amsterdam: IOS Press pp. 743-744.
• Caminada, M. 2006. Semi-stable semantics. In: Dunne, P. E. and Bench-Capon, T. J. M. eds. Computational Models of Argument., Vol. 144. Frontiers in Artificial Intelligence and Applications IOS Press, pp. 121-130.

1998

• Caminada, M., van de Riet, R., van Zanten, A. and van Doorn, L. 1998. Internet security incidents, a survey within Dutch organizations. Computers and Security 17(5), pp. 417-433.