Enumerating extensions on random abstract-AFs with ArgTools, ASPARTIX, ConArg2, and Dung-O-Matic. (English) Zbl 1425.68403

Bistarelli, Stefano; Rossi, Fabio; Santini, Francesco

Bulling, Nils (ed.) et al., Computational logic in multi-agent systems. 15th international workshop, CLIMA XV, Prague, Czech Republic, August 18–19, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8624, 70-86 (2014).

Summary: We compare four different implementations of reasoning tools dedicated to abstract argumentation frameworks. These systems are ArgTools, ASPARTIX, ConArg2, and Dung-O-Matic. They have been tested over three different models of randomly-generated graph models, corresponding to the Erdős-Rényi model, the Kleinberg small-world model, and the scale-free Barabasi-Albert model. This first comparison is useful to study the behaviour of these reasoners over networks with different topologies (including small-world ones): we scale the number of arguments to check the limits of today’s systems. Such results can be used to guide further improvements, specifically ConArg2, which we recently developed, and tested for the first time in this work.
For the entire collection see [Zbl 1293.68019].

MSC:

68T35	Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence
05C80	Random graphs (graph-theoretic aspects)
05C82	Small world graphs, complex networks (graph-theoretic aspects)
68T27	Logic in artificial intelligence
68T42	Agent technology and artificial intelligence

Software:

ConArg2