Bowers, Shawn, Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Ludäscher, Bertram
2025.
Winning by numbers: connecting strong admissibility to optimal play in argumentation.
Presented at: The 18th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2025),
Hagen, Germany,
23-26 September 2025.
Published in: Sauerwald, Kai and Thimm, Matthias eds.
Proceedings of the European Conference on Symbolic and Quantitative Approaches with Uncertainty.
Lecture Notes in Computer Science
, vol.16099
Springer Nature,
pp. 395-410.
10.1007/978-3-032-05134-9_27
|
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238
2025.
Strong admissibility and infinite argumentation frameworks.
Presented at: ECSQARU,
Hagen, Germany,
23-26 September 2025.
Published in: Sauerwald, Kai and Thimm, Matthias eds.
Proceedings of the 18th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty.
Lecture Notes in Computer Science
, vol.16099
Springer,
pp. 424-436.
10.1007/978-3-032-05134-9_29
|
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238, König, Matthias, Rapberger, Anna and Ulbricht, Markus
2025.
Attack semantics and collective attacks revisited.
Argument and Computation
16
(2)
, pp. 151-211.
10.3233/AAC-230011
|
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Harikrishnan, Sri
2025.
Tractable algorithms for strong admissibility.
Argument and Computation
16
(2)
, pp. 212-236.
10.3233/AAC-230012
|
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238
2025.
Strong Admissibility for Infinite Argumentation Frameworks.
Presented at: First European Workshop on Argumentation and Uncertainty (ArgU'25),
Hagen, Germany,
23rd September 2025.
Published in: Delobelle, Jérôme, Mailly, Jean-Guy, Rossit, Julien and Skiba, Kenneth eds.
First European Workshop on Argumentation and Uncertainty (ArgU'25).
Hagen, Germany:
|
|
|
Sá, Samy, Dvořák, Wolfgang and Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238
2024.
Syntactic and semantic connections between logic programming and argumentation systems.
Thimm, Matthias, ed.
Handbook of Formal Argumentation, Volume 3,
Vol. 3.
College Publications,
Item availability restricted. |
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Harikrishnan, Sri
2024.
An evaluation of algorithms for strong admissibility.
Presented at: The Fifth International Workshop on Systems and Algorithms for Formal Argumentation (SAFA 2024),
Hagen, Germany,
17 September 2024.
CEUR Workshop Proceedings.
, vol.SAFA24
pp. 69-82.
|
|
|
Baroni, Pietro, Cerutti, Federico ORCID: https://orcid.org/0000-0003-0755-0358 and Giacomin, Massimiliano
2022.
A generalized notion of consistency with applications to formal argumentation.
Toni, Polberg, Sylwia ORCID: https://orcid.org/0000-0002-0811-0226, Booth, Richard ORCID: https://orcid.org/0000-0002-6647-6381, Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Kido, Hiroyuki ORCID: https://orcid.org/0000-0002-7622-4428, eds.
Computational Models of Argument,
Vol. 353.
Frontiers in Artificial Intelligence and Applications,
IOS Press,
pp. 56-67.
(10.3233/FAIA220141)
|
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238, Harikrishnan, Sri and Sá, Samy
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, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Harikrishnan, Meenakshi
2022.
Strong admissibility, a tractable algorithmic approach.
Presented at: Fourth International Workshop on Systems and Algorithms for Formal Argumentation,
Cardiff, Wales,
13 September 2022.
Proceedings of the Fourth International Workshop on Systems and Algorithms for Formal Argumentation.
CEUR,
pp. 33-44.
|
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Dunne, Paul 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.
Published in: Prakken, H., Bistarelli, S., Santini, F. and Taticchi, C. eds.
Proceedings of COMMA 2020.
Frontiers in Artificial Intelligence and Applications
, vol.326
IOS Press,
pp. 135-146.
10.3233/FAIA200499
|
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Uebis, Sören
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.
Proceedings of COMMA 2020.
Frontiers in Artificial Intelligence and Applications
IOS Press,
pp. 455-456.
10.3233/FAIA200531
|
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Dunne, Paul
2019.
Strong admissibility revisited: theory and applications.
Argument and Computation
10
(3)
, pp. 277-300.
10.3233/AAC-190463
|
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Schulz, Claudia
2018.
On the equivalence between assumption-based argumentation
and logic programming (extended abstract).
Presented at: IJCAI-ECAI-18,
Stockholm,
13-19 July 2018.
|
|
|
Awad, Edmond, Caminada, Martin W. A. ORCID: https://orcid.org/0000-0002-7498-0238, Pigozzi, Gabriella, Podlaszewski, Mikolaj and Rahwan, Iyad
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, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Schulz, Claudia
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, Martin ORCID: https://orcid.org/0000-0002-7498-0238
2017.
Rationality postulates: applying argumentation theory for non-monotonic reasoning.
Journal of Applied Logics
4
(8)
, pp. 2707-2734.
|
|
|
Awad, Edmond, Bonnefon, Jean-Francois, Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Rahwan, Iyad
2017.
Experimental assessment of aggregation principles in argumentation-enabled collective intelligence.
ACM Transactions on Internet Technology
17
(3)
, 29.
10.1145/3053371
|
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238
2017.
Argumentation semantics as formal discussion.
Journal of Applied Logics
4
(8)
, pp. 2457-2492.
|
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238
2017.
Rationality postulates: applying argumentation theory for non-monotonic reasoning.
Gabbay, Dov, Torre, Leon van der, Baroni, Pietro and Giacomin, Massimiliano, eds.
Handbook of Formal Argumentation, Volume 1,
College Publications,
|
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238
2017.
Argumentation semantics as formal discussion.
Gabbay, Dov, Torre, Leon van der, Giacomin, Massimiliano and Baroni, Pietro, eds.
Handbook of Formal Argumentation, Volume 1,
College Publications,
|
|
|
Caminada, Martin W. A. ORCID: https://orcid.org/0000-0002-7498-0238, Dvořák, Wolfgang and Vesic, Srdjan
2016.
Preferred semantics as Socratic discussion.
Journal of Logic and Computation
26
(4)
, pp. 1257-1292.
10.1093/logcom/exu005
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Booth, Richard ORCID: https://orcid.org/0000-0002-6647-6381
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.
Published in: Baroni, Pietro, Gordon, Thomas F., Scheffler, Tatjana and Stede, Manfred eds.
Computational Models of Argument.
Frontiers in Artificial Intelligence and Applications
, vol.287
IOS Press,
pp. 179-190.
10.3233/978-1-61499-686-6-179
|
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238, Sá, Samy, Alcântara, João and Dvořák, Wolfgang
2015.
On the difference between assumption-based argumentation and abstract argumentation.
IfCoLog Journal of Logic and its Applications
2
(1)
, pp. 15-34.
|
|
|
Sakama, Chiaki, Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Herzig, Andreas
2015.
A formal account of dishonesty.
Logic Journal of the IGPL
23
(2)
, pp. 259-294.
10.1093/jigpal/jzu043
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 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
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238, Sa, Samy, Alcantara, Joao and Dvorak, Wolfgang
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, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Schulz, Claudia
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, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Sakama, Chiaki
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.
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238
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.
Published in: Black, Elizabeth, Modgil, Sanjay and Oren, Nir eds.
Theory and Applications of Formal Argumentation: Third International Workshop, TAFA 2015, Buenos Aires, Argentina, July 25-26, 2015, Revised Selected Papers.
Lecture Notes in Computer Science.
Lecture Notes in Computer Science
, vol.9524
Springer,
pp. 59-73.
10.1007/978-3-319-28460-6_4
|
|
Booth, Richard ORCID: https://orcid.org/0000-0002-6647-6381, Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238, Paul, Dunne, Mikolaj, Podlaszewski and Iyad, Rahwan
2014.
Complexity properties of critical sets of arguments.
Presented at: 6th International Conference on Computational Models of Argument,
Pitlochry, UK,
9-12 September 2014.
|
|
|
Booth, Richard, Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238, Dunne, Paul E., Podlaszewski, Mikolaj and Rahwan, Iyad
2014.
Complexity properties of critical sets of arguments.
Parsons, S., Oren, N., Reed, N. and Cerutti, Federico, eds.
Computational Models of Argument: Proceedings of COMMA 2014,
Vol. 266.
IOS Press,
pp. 173-184.
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Oren, Nir
2014.
Grounded semantics and infinitary argumentation frameworks.
Presented at: The 26th Benelux Conference on Artificial Intelligence,
Nijmegen, The Netherlands,
6-7 November 2014.
|
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238, Modgil, Sanjay and Oren, Nir
2014.
Preferences and unrestricted rebut.
Computational Models of Argument,
Frontiers in Artificial Intelligence and Applications,
vol. 266.
IOS Press,
pp. 209-220.
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238
2014.
Strong admissibility revisited.
Parsons, Simon, Oren, Nir, Reed, Chris and Cerutti, Federico, 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)
|
|
Arieli, Ofer and Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238
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
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238, Carnielli, Walter A. and Dunne, Paul E.
2012.
Semi-stable semantics.
Journal of Logic and Computation
22
(5)
, pp. 1207-1254.
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Podlaszewski, Mikolaj
2012.
Grounded semantics as persuasion dialogue.
Computational Models of Argument
245
, pp. 478-485.
|
|
Arieli, Ofer and Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238
2012.
A general QBF-based formalization of abstract argumentation theory.
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)
|
|
Baroni, Pietro, Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Giacomin, Massimiliano
2011.
An introduction to argumentation semantics.
Knowledge Engineering Review
26
(4)
, pp. 365-410.
10.1017/S0269888911000166
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Pigozzi, Gabriella
2011.
On judgment aggregation in abstract argumentation.
Autonomous Agents and Multi-Agent Systems
22
(1)
, pp. 64-102.
10.1007/s10458-009-9116-7
|
|
Sakama, Chiaki, Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Herzig, Andreas
2010.
A logical account of lying.
Lecture Notes in Computer Science
6341
, pp. 286-299.
10.1007/978-3-642-15675-5_25
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238
2010.
An algorithm for stage semantics.
Baroni, P., Cerutti, F., Giacomin, M. and Simari, G. R., 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)
|
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Wu, Yining
2009.
An argument game for stable semantics.
Logic Journal of the IGPL
17
(1)
, pp. 77-90.
10.1093/jigpal/jzn029
|
|
Dunne, Paul E. and Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238
2008.
Computational complexity of semi-stable semantics in abstract argumentation frameworks.
Presented at: JELIA 2008,
Dresden, Germany,
28 Sep - 1 Oct 2008.
Published in: Hölldobler, Steffen, Lutz, Carsten and Wansing, Heinrich eds.
Logics in Artifical Intelligence.
Lecture Notes in Computer Science.
(5293)
Berlin:
Springer Verlag,
pp. 153-165.
10.1007/978-3-540-87803-2_14
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238
2008.
On the issue of contraposition of defeasible rules.
Presented at: COMMA 2008,
Toulouse, France,
28-30 May 2008.
Published in: Besnard, P., Doutre, S. and Hunter, A. eds.
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008.
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008.
, vol.172
Amsterdam:
IOS Press,
pp. 109-115.
|
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Amgoud, Leila
2007.
On the evaluation of argumentation formalisms.
Artificial Intelligence
171
(5-6)
, pp. 286-310.
10.1016/j.artint.2007.02.003
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238
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
|
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238
2006.
On the issue of reinstatement in argumentation.
Lecture Notes in Computer Science
4160
, pp. 111-123.
10.1007/11853886_11
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Sakama, Chiaki
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.
Published in: Brewka, G., Coradeschi, S., Perini, A. and Traverso, P. eds.
ECAI 2006: 17th European Conference on Artificial Intelligence., August 29 - Spetember 1, Riva del Garda, Italy.
ECAI 2006, PROCEEDINGS.
, vol.141
Amsterdam:
IOS Press,
pp. 743-744.
|
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238
2006.
Semi-stable semantics.
Dunne, Paul E. and Bench-Capon, Trevor J. M., eds.
Computational Models of Argument,
Vol. 144.
Frontiers in Artificial Intelligence and Applications,
IOS Press,
pp. 121-130.
|
|
Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238, van de Riet, Reind, van Zanten, Arjen and van Doorn, Leendert
1998.
Internet security incidents, a survey within Dutch organizations.
Computers and Security
17
(5)
, pp. 417-433.
|
|



Up a level