GG-STS

The tool is an argumentation solver that accepts both types of argumentation input formats (Aspartix and simple graphs) and can solve the following tasks:

• Credulous reasoning about extensions according to following semantics:
  • Complete semantics,
  • Preferred semantics,
  • Stable semantics,
  • Semi-stable semantics,
  • Stage semantics,
  • Grounded semantics, and,
  • Ideal semantics.
• Skeptical reasoning about extensions according to following semantics:
  • Complete semantics,
  • Preferred semantics,
  • Stable semantics,
  • Semi-stable semantics, and,
  • Stage semantics.
• Finding an extension according to following semantics:
  • Complete semantics,
  • Preferred semantics,
  • Stable semantics,
  • Semi-stable semantics,
  • Stage semantics,
  • Grounded semantics, and,
  • Ideal semantics.
• Finding all extensions according to following semantics:
  • Complete semantics,
  • Preferred semantics,
  • Stable semantics,
  • Semi-stable semantics, and,
  • Stage semantics.

The GG-STS solver is based on top of SAT-to-SAT solver and works by converting argumentation instances into SAT-to-SAT inputs.

Compiling

In order to compile gg-sts, download and unzip the source code of gg-sts and run the following command:

$ ./build.sh

Simple Example

This example describes how to run gg-sts on a simple argumentation instance. Consider the following instance (arg1.txt):

arg(a1).
arg(a2).
arg(a3).
att(a1,a2).
att(a2,a3).
att(a2,a1).

The following commands show how to use gg-sts to find one/all complete extensions of arg1.txt:

$ ./run.sh -p SE-CO -fo apx -f arg1.txt
[]
$ ./run.sh -p EE-CO -fo apx -f arg1.txt
[[],[a3,a1],[a2]]


Similarly, the following commands show how to do credulous/skeptical reasoning using gg-sts on complete extensions of arg1.txt:

$ ./run.sh -p DC-CO -a a1 -fo apx -f arg1.txt
YES
$ ./run.sh -p DS-CO -fo apx -f arg1.txt
NO


Download

You can download the source code of gg-sts here.