The publication list below contains only the publications since I finished my PhD thesis (2004)

Journal Articles

• M.W.A. Caminada, M. König, A. Rapberger and M. Ulbricht. Attack Semantics and Collective Attacks Revisited. Argument & Computation 16(2):151-211 (2025)
• M.W.A. Caminada and S. Harikrishnan. Tractable Algorithms for Strong Admissibility. Argument & Computation 16(2):212-235 (2025)
• M.W.A. Caminada and S. Harikrishnan and S. Sá. Comparing Logic Programming and Formal Argumentation; the case of Ideal and Eager Semantics. Argument & Computation 13(1):91-120 (2022)
• M.W.A. Caminada and P. Dunne. Strong admissibility revisited: theory and applications. Argument & Computation 10(3):277-300 (2019)
• M.W.A. Caminada and C. Schulz. On the Equivalence between Assumption-Based Argumentation and Logic Programming. Journal of Artificial Intelligence Research 60:779-825 (2017)
• M.W.A. Caminada. Argumentation Semantics as Formal Discussion. IfCoLog Journal of Logic and its Applications 4(8):2457-2492 (2017)
• M.W.A. Caminada. Rationality Postulates: Applying Argumentation Theory for Non-Monotonic Reasoning. IfCoLog Journal of Logic and its Applications 4(8):2707-2733 (2017)
• E. Awad, J.-F. Bonnefon, M.W.A. Caminada, Th. Malone and I. Rahwan. Experimental Assessment of Aggregation Principles in Argumentation-Enabled Collective Intelligence. ACM Transactions on Internet Technology 17(3) (2017)
• E. Awad, M.W.A. Caminada, G. Pigozzi, M. Podlaszewski and I. Rahwan. Pareto Optimality and Strategy-Proofness in Group Argument Evaluation. Journal of Logic and Computation 27(8):2581-2609 (2017)
• M.W.A. Caminada, W. Dvořák and S. Vesic. Preferred Semantics as Socratic Discussion. Journal of Logic and Computation 26(4):1257-1292 (2016)
• M.W.A. Caminada, S. Sá, J. Alcântara and W. Dvořák. On the Difference between Assumption-Based Argumentation and Abstract Argumentation. IfCoLog Journal of Logic and its Applications 2(1):15-34 (2015)
• M.W.A. Caminada, S. Sá, J. Alcântara and W. Dvořák. On the Equivalence between Logic Programming Semantics and Argumentation Semantics. International Journal of Approximate Reasoning 58:87-111 (2015)
  (Please notice that argument A₀ and conclusion x should be added to the table after Figure 4. Both are undec in all three labellings.)
• Ch. Sakama, M.W.A. Caminada and A. Herzig. A Formal Account of Dishonesty. The Logic Journal of the IGPL 23(2):259-294 (2015)
• O. Arieli and M.W.A. Caminada. A QBF-based Formalization of Abstract Argumentation Semantics. Journal of Applied Logic 11(2):229-252 (2013)
• M.W.A. Caminada, W.A. Carnielli, P.E. Dunne. Semi-Stable Semantics. Journal of Logic and Computation 22(5):1207-1254 (2012)
• P. Baroni, M.W.A. Caminada and M. Giacomin. An Introduction to Argumentation Semantics. The Knowledge Engineering Review 26(04):365-410 (2011)
• M.W.A. Caminada. A Labelling Approach for Ideal and Stage Semantics. Argument & Computation 2(1):1-21 (2011)
• M.W.A. Caminada and G. Pigozzi. On Judgment Aggregation in Abstract Argumentation. JAAMAS 22(1):64-102 (2011)
  The original publication is available at www.springerlink.com (DOI: 10.1007/s10458-009-9116-7)
• Y. Wu and M.W.A. Caminada. A Labelling-Based Justification Status of Arguments. Studies in Logic 3(4):12-29 (2010)
  (NOTE: an analysis of computational complexity issues regarding this work is given in a follow-up paper presented by Wolfgang Dvořák at TAFA 2011)
• M.W.A. Caminada and Dov M. Gabbay. A Logical Account of Formal Argumentation. Studia Logica 93(2-3):109-145 (2009)
  The original publication is available on www.springerlink.com (DOI: 10.1007/s11225-009-9218-x)
• Y. Wu, M.W.A. Caminada and Dov Gabbay. Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic Programming. Studia Logica 93(2-3):383-403 (2009)
  The original publication is available on www.springerlink.com (DOI: 10.1007/s11225-009-9210-5)
• M.W.A. Caminada and Y. Wu. An Argument Game for Stable Semantics. Logic Journal of the IGPL 17(1):77-90 (2009)
• M.W.A. Caminada. A formal account of Socratic-style argumentation. Journal of Applied Logic 6(1):109-132 (2008)
• M.W.A. Caminada and L. Amgoud. On the evaluation of argumentation formalisms. Artificial Intelligence 171(5-6):286-310 (2007)
  (Please notice that the condition "S is consistent" in Theorem 2 and 4 should be read as "Cl_pp(S) is consistent" and "Cl_tp(S) is consistent", respectively.)

Book Chapters

• S. Sá, W. Dvořák and M.W.A. Caminada. Syntactic and Semantic Connections between Logic Programming and Argumentation Systems. Book chapter in Handbook of Formal Argumentation. (in print)
• P. Baroni, M.W.A. Caminada and M. Giacomin. Abstract Argumentation Frameworks and their Semantics. Book chapter in Handbook of Formal Argumentation. Editors: P. Baroni, D. Gabbay, M. Giacomin and L. van der Torre. Pages: 159-236. (2018)
• M.W.A. Caminada. Argumentation Semantics as Formal Discussion. Book chapter in Handbook of Formal Argumentation. Editors: P. Baroni, D. Gabbay, M. Giacomin and L. van der Torre. Pages: 487-518. (2018)
• M.W.A. Caminada. Rationality Postulates: applying argumentation theory for non-monotonic reasoning. Book chapter in Handbook of Formal Argumentation. Editors: P. Baroni, D. Gabbay, M. Giacomin and L. van der Torre. Pages: 771-795. (2018)
  (Note: In definition 8, the head of the transposed rule should be -φ_i instead of -φ. In Example 3, wfr should be added to the premisses.)
• S. Modgil and M.W.A. Caminada. Proof Theories and Algorithms for Abstract Argumentation Frameworks book chapter in I. Rahwan and G. Simari (eds.) Argumentation in Artificial Intelligence

Conference and Workshop Papers

• M.W.A. Caminada. Strong Admissibility for Infinite Argumentation Frameworks. ArgU 2025 (in print).
• S. Bowers, M.W.A. Caminada and B. Ludäscher. Winning by Numbers: Connecting Strong Admissibility to Optimal Play in Argumentation. ECSQARU 2025 (in print).
• M.W.A. Caminada. Strong Admissibility and Infinite Argumentation Frameworks. ECSQARU 2025 (in print).
• M.W.A. Caminada and S. Harikrishnan. An Evaluation of Algorithms for Strong Admissibility. SAFA 2024, pages 69-82.
• M.W.A. Caminada and S. Harikrishnan. Strong Admissibility, a Tractable Algorithmic Approach. SAFA 2022, pages 33-44.
• M.W.A. Caminada and P.E. Dunne. Minimal Strong Admissibility: a Complexity Analysis. COMMA 2020, pages 135-146.
• M.W.A. Caminada and C. Schulz. On the Equivalence between Assumption-Based Argumentation and Logic Programming (Extended Abstract). IJCAI-ECAI 2018, Stockholm, pages 5578-5582.
• M.W.A. Caminada and R. Booth. A Dialectical Approach for Argument-Based Judgment Aggregation. COMMA 2016, Potsdam, pages 179-190.
• M.W.A. Caminada and Ch. Sakama. On the Issue of Argumentation and Informedness. AAA 2015, Kanagawa, pages 317-330.
• M.W.A. Caminada. A Discussion Game for Grounded Semantics. TAFA 2015, Buenos Aires, pages 59-73.
• M.W.A. Caminada and C. Schulz. On the Equivalence between Assumption-Based Argumentation and Logic Programming. ArgLP 2015, Cork.
• M.W.A. Caminada and N. Oren. Grounded Semantics and Infinitary Argumentation Frameworks. BNAIC 2014, Nijmegen, pages 25-32.
• M.W.A. Caminada. Strong Admissibility Revisited. COMMA 2014, Pitlochry, pages 197-208.
• M.W.A. Caminada, S. Modgil and N. Oren. Preferences and Unrestricted Rebut. COMMA 2014, Pitlochry, pages 209-220.
  (Please notice that the condition "A rebuts B and A ⊀_p B" in Definition 7 should be read as "A rebuts B on B' and A ⊀_p B'")
• R. Booth, M.W.A. Caminada, P.E. Dunne, M. Podlaszewski and I. Rahwan. Complexity Properties of Critical Sets of Arguments. COMMA 2014, Pitlochry, pages 173-184.
• M.W.A. Caminada, S. Sá, J. Alcântara and W. Dvořák. On the Difference between Assumption-Based Argumentation and Abstract Argumentation. BNAIC 2013, Delft, pages 25-32.
• M.W.A. Caminada, S. Sá and J. Alcântara. On the Equivalence between Logic Programming Semantics and Argumentation Semantics ECSQARU 2013, Utrecht, pages 97-108.
• M.W.A. Caminada and S. Vesic. On extended conflict-freeness in argumentation. BNAIC 2012, Maastricht, pages 43-50.
• M.W.A. Caminada and M. Podlaszewski. Grounded Semantics as Persuasion Dialogue. COMMA 2012, Vienna, pages 478-485.
• O. Arieli and M.W.A. Caminada. A General QBF-based Formalization of Abstract Argumentation Theory. COMMA 2012, Vienna, pages 105-116.
• R. Booth, M.W.A. Caminada, M. Podlaszewski and I. Rahwan. Quantifying disagreement in argument-based reasoning. AAMAS 2012, Valencia, pages 493-500.
• M.W.A. Caminada and Y. Wu. On the Limitations of Abstract Argumentation BNAIC 2011, Gent
• M.W.A. Caminada, G. Pigozzi and M. Podlaszewski. Manipulation in Group Argument Evaluation. IJCAI 2011, Barcelona, pages 121-126.
• E. Staab and M.W.A. Caminada. On the Profitability of Incompetence. MABS 2010 (LNCS 6532), Toronto, pages 76-91.
• M.W.A. Caminada. Preferred Semantics as Socratic Discussion. First Workshop on Argumentation in Artificial Intelligence and Philosophy: computational and philosophical perspectives, Brescia, pages 209-216 (2010)
• Ch. Sakama, M.W.A. Caminada and A. Herzig. A Logical Account of Lying. JELIA 2010, Helsinki, pages 286-299.
• M.W.A. Caminada. An Algorithm for Stage Semantics. COMMA 2010, Desenzano del Garda, pages 147-158.
• M.W.A. Caminada and B. Verheij. On the Existence of Semi-Stable Extensions. BNAIC 2010.
• Y. Wu and M.W.A. Caminada. Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic Programming. BNAIC 2009, pages 51-57.
• M.W.A. Caminada. Truth, Lies and BS; distinguishing classes of dishonesty. BNAIC 2009, pages 301-302 (short paper).
• M.W.A. Caminada. Truth, Lies and Bullshit; distinguishing classes of dishonesty. Proceedings SS@IJCAI 2009 (Workshop on Social Simulation) pages 39-50.
• M.W.A. Caminada and Y. Wu. Towards an Argument Game for Stable Semantics. CMNA 2008.
• P.E. Dunne and M.W.A. Caminada. Computational Complexity of Semi-Stable Semantics in Abstract Argumentation Frameworks. JELIA 2008, pages 153-165.
• M.W.A. Caminada. On the Issue of Contraposition of Defeasible Rules. COMMA 2008, pages 109-115.
• M.W.A. Caminada. Comparing Two Unique Extension Semantics for Formal Argumentation: Ideal and Eager BNAIC 2007, pages 81-87.
• M.W.A. Caminada. An Algorithm for Computing Semi-Stable Semantics. ECSQARU 2007, pages 222-234.
• M.W.A. Caminada and Ch. Sakama. On the Existence of Answer Sets in Normal Extended Logic Programs. NRAC 2007.
• M.W.A. Caminada. On the Formalization of Socratic Dialogue. Proceedings of the Sixth Conference of the International Society for the Study of Argumentation (ISSA), pages 201-205 (2007)
• M.W.A. Caminada. On the Issue of Reinstatement in Argumentation. JELIA 2006, pages 111-123.
• M.W.A. Caminada. Semi-Stable Semantics COMMA 2006, pages 121-130.
• M.W.A. Caminada and Ch. Sakama. On the Existance of Answer Sets in Normal Extended Logic Programs. ECAI 2006, pages 743-744 (short paper)
• M.W.A. Caminada. Well-Founded semantics for Semi-Normal Extended Logic Programs. NMR 2006, pages 103-108.
• M.W.A. Caminada. Contamination in Formal Argumentation Systems. BNAIC 2005), pages 59-65
• M.W.A. Caminada and L. Amgoud. An Axiomatic Account of Formal Argumentation. Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI-05). Pittsburgh PA, pages 608-613 (2005)
• M.W.A. Caminada. Dialogues and HY-arguments International Workshop on Nonmonotonic Reasoning (NMR2004); Argument Dialogue and Decision. Whistler BC, Canada (2004)

Software Demonstrators

• M.W.A. Caminada and S. Uebis An Implementation of Argument-Based Discussion using ASPIC- COMMA 2020, pages 455-456.
• B. Marshall, R. Booth and M.W.A. Caminada. DISCO: a Web-Based Implementation of Discussion Games for Grounded and Preferred Semantics. COMMA 2018, pages 453-454.
• M.W.A. Caminada, R. Kutlak, N. Oren and W.W. Vasconcelos. Scrutable Plan Enactment vis Argumentation and Natural Language Generation. AAMAS 2014, pages 1625-1626.
• M.W.A. Caminada and M. Podlaszewski. User-Computer Persuasion Dialogue for Grounded Semantics. BNAIC 2012, Maastricht, pages 343-344.
• M. Podlaszewski, M.W.A. Caminada and G. Pigozzi. An Implementation of Basic Argumentation Components. AAMAS 2011 (see also the associated YouTube movie)
• M. Podlaszewski, M.W.A. Caminada and Y. Wu. An Implementation of Basic Argumentation Components. COMMA 2010
• E. Staab and M.W.A Caminada Simulating Knowledge and Discovery in a Client-Consultant Setting. BNAIC 2009, pages 397-398 (see also the associated poster)
• P. Barbini, Y. Wu and M.W.A. Caminada. An Implementation of Argument Based Discussion. AAMAS 2009. (see the homepage of Yining Wu for sources and executables)

Technical Reports

• M.W.A. Caminada and S. Harikrishnan. Strong Admissibility, a Tractable Algorithmic Approach (proofs). Cardiff University (2022)
• M.W.A. Caminada. Strong admissibility in acyclic argumentation frameworks. Cardiff University (2020)
• M.W.A. Caminada and C. Schulz. On the Equivalence between Assumption-Based Argumentation and Logic Programming. University of Aberdeen (2015)
• M.W.A. Caminada. A Discussion Game for Grounded Semantics (proofs). University of Aberdeen (2015)
• M.W.A. Caminada. Strong Admissibility Revisited (proofs). University of Aberdeen (2014)
• M.W.A. Caminada, S. Sá, J. Alcântara and W. Dvořák. On the Difference between Assumption-Based Argumentation and Abstract Argumentation. University of Aberdeen (2013)
• M.W.A. Caminada, S. Sá and J. Alcântara. On the Equivalence between Logic Programming Semantics and Argumentation Semantics. Technical Report ABDN--CS--13--01, University of Aberdeen (2013)
• E. Staab and M.W.A. Caminada. Assessing the Impact of Informedness on a Consultant's Profit. University of Luxembourg. ISBN 978-2-87971-027-3
• M.W.A. Caminada. An Algorithm for Computing Semi-Stable Semantics. Technical Report UU-CS-2007-010, Utrecht University (2007)
• M.W.A. Caminada and Jonathan Ben-Naim. Postulates for Paraconsistent Reasoning and Fault Tolerant Logic Programming. Technical Report UU-CS-2007-004, Utrecht University (2007)
• M.W.A. Caminada. On the Issue of Reinstatement in Argumentation. Technical Report UU-CS-2006-023, Utrecht University (2006)
• M.W.A. Caminada. Collapse in Formal Argumentation Systems. Technical report UU-CS-2005-023. Utrecht University (2005)
• M.W.A. Caminada and L. Amgoud. An axiomatic account of formal argumentation. Technical report (2005)

PhD Thesis

• M.W.A. Caminada. For the Sake of the Argument; explorations into argument-based reasoning. PhD thesis Vrije Universiteit Amsterdam (2004)

Unpublished and Informal Work

• M.W.A. Caminada. Some Open Issues in Argumentation and KR. Leon50 - Arguing about Logic; Debates in Individual and Collective Reasoning (2018)
• M.W.A. Caminada and M. Podlaszewski. AdmBuster: a benchmark example for (strong) admissibility (benchmark example submitted to ICCMA 2017)
• M.W.A. Caminada and B. Verheij. SemBuster: a benchmark example for semi-stable semantics (benchmark example submitted to ICCMA 2017)
• M.W.A. Caminada and M. Giacomin. Introducing the Special Issue on 20 Years of Argument-Based Inference (editorial JLC special issue, 2014)
• M.W.A. Caminada. Argument, Discussion and Rationality (position paper, 2014)
• M.W.A. Caminada. On the Issue of Argumentation and Informedness (informal technical report)
• M.W.A. Caminada. A Gentle Introduction to Argumentation Semantics. (lecture material)