2nd International Competition on Computational Models of Argumentation

News

  • 2017-08-20: First results presented at TAFA.
  • 2017-05-22: Lists of solver and benchmark submissions online
  • 2017-02-27: TAFA 2017 system track announced
  • 2016-12-05: Participation page updated
  • 2016-09-27: SAFA paper available
  • 2016-07-11: Webpage online

Important Dates

  • 2017-01-15: Declaration of intent
  • 2017-02-01: Benchmark submission
  • 2017-03-15: Solver submission
  • 2017-04-15: System descriptions
  • 2017-08-19/20: Presentation of results

Overview

The second edition of the International Competition on Computational Models of Argument will be conducted in the first half of 2017. The results will be presented at the Internation Workshop on Theory and Applications of Formal Argument (TAFA'17) which will be co-located with the 26th International Joint Conference on Artificial Intelligence.

The first edition of ICCMA took place in 2015 and saw the participation of 18 solvers. A summary report on the competition has been published in the AI Magazine.

ICCMA'17 will focus on reasoning tasks in abstract argumentation frameworks, cf. [Dung 1995]. Submitted solvers will be tested on several artificially generated argumentation frameworks and some frameworks formalizing real-world problems.

The competition will consist of 7 main tracks, one for each semantics:

  1. Complete Semantics
  2. Preferred Semantics
  3. Stable Semantics
  4. Semi-stable Semantics [Caminada et. al. 2012]
  5. Stage Semantics [Verheij 1996]
  6. Grounded Semantics
  7. Ideal Semantics [Dung et. al. 2007]

Each track will include the following reasoning problems (only a. and c. for grounded and ideal):

  1. Given an abstract argumentation framework, determine some extension
  2. Given an abstract argumentation framework, determine all extensions
  3. Given an abstract argumentation framework and some argument, decide whether the given argument is credulously inferred
  4. Given an abstract argumentation framework and some argument, decide whether the given argument is skeptically inferred

Finally, the special track “Dung's Triathlon” will require solvers to enumerate all extensions of all standard Dung-semantics (complete, preferred, stable, grounded) at once.

TAFA 2017 features a system track particularly suited for, but not limited to, ICCMA participants to submit extended 5 page system descriptions.

Contact

For questions and comments to the organizers please send a mail to iccma17@dbai.tuwien.ac.at.

To receive regular updates concerning the competition subscribe to the mailing list of ICCMA argumentationcompetition@inria.fr by sending a mail with the subject

   subscribe argumentationcompetition <your first name> <your surname>

to sympa_inria@inria.fr

Previous Editions and related events


[Dung 1995] Dung, P.M. 1995. On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games. Artif. Intell. 77(2):321-358.
[Verheij 1996] Verheij, B. 1996. Two approaches to dialectical argumentation: admissible sets and argumentation stages. Proceedings NAIC'96: 357-368.
[Dung et. al. 2007] Dung, P.M., Mancarella, P., Toni, F. 2007. Computing ideal sceptical argumentation. Artif. Intell. 171(10-15): 642-674.
[Caminada et. al. 2012] Caminada, M., Carnielli, W.A., Dunne P.E. 2012. Semi-stable semantics. J. Log. Comput. 22(5): 1207-1254.