EqArgSolver must be invoked from the command line. In Windows, run a terminal window by right-clicking “Start” then typing “cmd” and then invoking EqArgSolver as detailed below. For linux, simply type eqargsolver in any terminal window.
where command is one of
<command> -f <inputfile> -p <problem> -fo tgf [-a <argumenttocheck>]
eqargsolver32.exe(Windows 32-bit); or
inputfileis an input file in the TGF file format; and
problemis one of
SE-σ: compute one extension under semantics σ
EE-σ: compute all extensions under semantics σ
DC-σ: decide whether
argumenttocheckis accepted in some extension under semantics σ (decide credulously)
DS-σ: decide whether
argumenttocheckis accepted in all extensions under semantics σ (decide skeptically)
For example, consider the argumentation framework of Figure 6.2 (taken from “Efficient Computation of Argumentation Semantics”, by Beishui Liao, page 72):
Its TGF representation is as follows (click here to download this file):
a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 # a1 a2 a2 a1 a2 a5 a2 a3 a3 a4 a4 a5 a5 a6 a6 a5 a7 a6 a7 a7 a8 a7 a9 a8 a10 a9
To calculate all preferred extensions of this network, invoke eqargsolver as follows (linux version assumed):
./eqargsolver -f f6.2.tgf -fo tgf -p EE-PR
EqArgSolver will return
indicating that the sets with arguments
[a1,a10,a3,a5,a8] correspond to all the preferred extensions of this network.
Similarly, notice that
a10 is accepted in all preferred extensions;
a2 is accepted
in one of the preferred extensions but not all; and
a9 is not accepted in any preferred extenstions. Therefore, the
following invokations of EqArgSolver would produce the corresponding results below.
||-p DC-PR||-p DS-PR|
EqArgSolver is not currently able to handle very large problems in the preferred semantics. By large we mean a network with a large number of nodes in a single SCC, or a network with a large number of non-trivial SCCs, or a combination of these, especially if these SCCs appear close to a source node in the network induced by the SCCs. EqArgSolver has successfully run is less complex networks with up to 2,500,000 arguments.
The two papers below describe EqArgSolver in some detail, although improvements are regularly made to the solver.
Downloading EqArgSolverEqArgSolver has been submitted to the 2nd International Competition on Computational Models of Argumentation, but it is not yet avalable for general distribution. Public distribution will be available late in 2018. In the meantime, you can request a copy directly to email@example.com.
EqArgSolver works as described in the picture below.
EqArgSolver is used as a laboratory for experimentation with algorithms for argumentation reasoning and as such is continually being updated.
In the Summer 2018, we will be implementing a framework to make EqArgSolver available through the Internet as a web page and a web service.