based on reduction to circumscription, which indicates that even more variety of solving techniques
can be fruitful for the development of the field.
While we think that future editions of ICCMA
should stick to a guided instance selection process as
described in this report, the community should aim
for benchmarks from real-world domains to be
included in future benchmark suites. On the technical side, changing the output format for enumeration
tasks could be beneficial for the verification of large
The next competition will be conducted in 2019.4
3. For detailed results, see argumentationcompetition
4. For more information, see argumentationcompetition.
This work has been supported by FWF (project
Atkinson, K.; Baroni, P.; Giacomin, M.; Hunter, A.; Prakken,
H.; Reed, C.; Simari, G. R.; Thimm, M.; and Villata, S. 2017.
Towards Artificial Argumentation. AI Magazine 38( 3): 25–36.
Baroni, P.; Caminada, M.; and Giacomin, M. 2011. An Introduction to Argumentation Semantics. The Knowledge Engineering Review
26( 4): 365–410.
Belov, A.; Diepold, D.; Heule, M. J. H.; and Järvisalo, M, eds.
2014. Proceedings of SAT Competition 2014: Solver and Benchmark Descriptions. Department of Computer Science Series
of Publications B. Report B-2014-2. Helsinki, Finland: University of Helsinki.
Bench-Capon, T. J. M., and Dunne, P. E. 2007. Argumentation in Artificial Intelligence. Artificial Intelligence 171( 10–
15): 619–41. doi.org/10.1016/j.artint.2007.05.001.
Caminada, M.; Carnielli, W.; and Dunne, P. E. 2012. SemiStable Semantics. Journal of Logic and Computation
Dung, P. M. 1995. On the Acceptability of Arguments and
Its Fundamental Role in Nonmonotonic Reasoning, Logic
Programming, and N-Person Games. Artificial Intelligence
77( 2): 321–58. doi.org/10.1016/0004-3702( 94)00041-X.
Dung, P. M.; Mancarella, P.; and Toni, F. 2007. Computing
Ideal Sceptical Argumentation. Artificial Intelligence 171( 10–
15): 642–74. doi.org/10.1016/j.artint.2007.05.003.
Dunne, P. E., and Wooldridge, M. 2009. Complexity of
Abstract Argumentation. In Argumentation in Artificial Intelligence, edited by I. Rahwan and G. Simari, 85–104. Berlin:
Dvorak, W. 2012. Computational Aspects of Abstract Argumentation. PhD dissertation, Institute of Information Systems, Technischen Universität Wien, Wien, Österreich.
Egly, U.; Gaggl, S. A.; and Woltran, S. 2010. Answer-Set Programming Encodings for Argumentation Frameworks.
Argument and Computation
1( 2): 147–77. doi.org/10.1080/
Gebser, M.; Maratea, M.; and Ricca, F. 2017. The Sixth
Answer Set Programming Competition. Journal of Artificial
Intelligence Research 60: 41–95.
Thimm, M., and Villata, S. 2017. The First International
Competition on Computational Models of Argumentation:
Results and Analysis. Artificial Intelligence 252:267–94.
Thimm, M.; Villata, S.; Cerutti, F.; Oren, N.; Strass, H.; and
Vallati, M. 2016. Summary Report of the First International
Competition on Computational Models of Argumentation.
37( 1): 102–4. doi.org/10.1609/aimag.v37i1.
Verheij, B. 1996. Two Approaches to Dialectical Argumentation: Admissible Sets and Argumentation Stages. In
Proceedings of the Eighth Dutch Conference on Artificial Intelligence, edited by J. J. Meyer and L. C. van der Gaag, 357–68.
Utrecht, the Netherlands: Utrecht University.
Sarah A. Gaggl is a postdoctoral research assistant at the
Computational Logic Group at the TU Dresden. She
received her PhD in computer science at TU Wien in 2013.
Her main research interests are in abstract argumentation,
answer set programming, and knowledge representation.
Thomas Linsbichler is a postdoctoral researcher at the
Institute of Information Systems of TU Wien, Austria. His
main research interests are in knowledge representation and
reasoning, argumentation, and algorithms.
Marco Maratea is an associate professor in computer engineering at University of Genoa, Italy. In the fall of 2015,
2016, and 2017, he was a university lecturer at the Institute
for Information Systems of the Faculty of Informatics at the
Vienna University of Technology. His research interests
include artificial intelligence, logic programming, and
knowledge representation and reasoning.
Stefan Woltran is professor of foundations of artificial
intelligence at Vienna University of Technology. His
research focuses on problems in the area of knowledge representation and reasoning, argumentation, complexity
analysis in artificial intelligence, and logic programming. In
the winter term 2013, he held a deputy professorship at
Leipzig University. In 2013, he also received the prestigious
START award from the Austrian Science Fund (FWF).