On structural properties of argumentation frameworks: Lessons from ICCMA

O. Rodrigues*, E. Black, M. Luck, J. Murphy

*Corresponding author for this work

Research output: Contribution to journalConference paperpeer-review

4 Citations (Scopus)


It is well known that the computation of solutions to decision and enumeration problems in argumentation can be very hard. In this work, we analyse some of the results of the 2017 International Competition on Computational Models of Argumentation. Our analysis shifts the focus from the performance of individual solvers to how well/badly they can collectively tackle different classes of abstract argumentation frameworks. In so doing, we were able to identify the instances that were particularly difficult for all/most solvers and look into their particular structural properties.

Original languageEnglish
Pages (from-to)22-35
Number of pages14
JournalCEUR Workshop Proceedings
Publication statusPublished - 1 Jan 2018
Event2nd International Workshop on Systems and Algorithms for Formal Argumentation, SAFA 2018 - Warsaw, Poland
Duration: 11 Sept 2018 → …


  • Argumentation competition
  • Argumentation semantics
  • Data analysis


Dive into the research topics of 'On structural properties of argumentation frameworks: Lessons from ICCMA'. Together they form a unique fingerprint.

Cite this