The results of the First International Competition on Computational Models of Argument (ICCMA) are now available.
And the winners are:
Congratulations!
Our own entry, Carneades 4.0, placed 2nd in all four of the grounded semantics “tracks”, and 7th overall, in a field of 18 solvers.
As expected, in the tracks for the intractable tasks (no pun indented), we didn’t stand a chance against the systems using SAT solvers. The argumentation frameworks used were too large for our straightforward generate and test algorithm.
You can try out the Carneades solver for Dung abstract argumentation frameworks online if you would like, using the Carneades server.