The three implementations here, and the experimental data, all relate to systems for assumption-based argumentation. proxdd implements standard tree-based dispute derivations, and abagraph and grapharg both implement an updated, graph-based alternative. abagraph is the more recent code, and is in effect an updated version of grapharg. The data on experiments is that referred to in the paper:
proxdd is an open-source Prolog program for SICStus (4.2+) or Yap (6.2+) Prolog, implementing the SXDD algorithm for assumption-based argumentation from the paper:
The source is downloadable from here:
abagraph is an open-source Prolog program for SICStus Prolog (4.2+), implementing a graph-based dispute derivation algorithm for assumption-based argumentation. The theory is described in the paper:
The source is downloadable from here:
grapharg is an open-source Prolog program for SICStus Prolog (4.2+), implementing a graph-based dispute derivation algorithm for assumption-based argumentation set out in the paper
The source is downloadable from here:
The structure of the three sources is the same. Put the script from each 'script/' directory (either 'proxdd', 'abagraph' or 'grapharg') in your PATH, make it executable, and edit the relevant variables in it to point to the right place. Then:
More details can be found in the tutorials for proxdd, abagraph and grapharg.
All code written by Robert Craven, in the Department of Computing, Imperial College London.