|
1 |
| -# proxdd |
| 1 | +# proxdd |
| 2 | + |
| 3 | +**proxdd** is an open-source Prolog program for SICStus (4.2+) or Yap (6.2+) Prolog, implementing the SXDD algorithm for assumption-based argumentation (ABA) from the paper: |
| 4 | + |
| 5 | + [A generalised framework for dispute derivations in assumption-based argumentation](https://www.sciencedirect.com/science/article/pii/S0004370212001233). |
| 6 | + Francesca Toni. *Artificial Intelligence*, volume 195, 2013. |
| 7 | + |
| 8 | +## Requirements |
| 9 | + |
| 10 | +**abagraph** has been tested on Ubuntu Linux, with SICStus Prolog 4.2+ and yap Prolog (6.2+). |
| 11 | + |
| 12 | +## Usage |
| 13 | + |
| 14 | +Basic usage can be described as follows. |
| 15 | + |
| 16 | +- After cloning the repository, `cd` to the `src/` directory. |
| 17 | +- Load abagraph by `sicstus -l proxdd.pl`. |
| 18 | +- ABA framework files are placed in `frameworks/`. (This contains some examples.) |
| 19 | +- To load a file from the `frameworks/` directory—such as `a12.pl`—do `loadf(a12).`. |
| 20 | +- To find a derivation for, say, the sentence `y1`, do `sxdd(y1, X).`. |
| 21 | + |
| 22 | +## Options |
| 23 | + |
| 24 | +Current values of options are displayed by: |
| 25 | + |
| 26 | + ?- options. |
| 27 | + |
| 28 | +To print the derivation steps during a call to `sxdd/2`, use: |
| 29 | + |
| 30 | + ?- set_verbose. |
| 31 | + |
| 32 | +To hide the derivation steps (default), use: |
| 33 | + |
| 34 | + ?- set_quiet. |
| 35 | + |
| 36 | +To output the solutions, as found, to a `.dot` file for visualization with `graphviz`, use: |
| 37 | + |
| 38 | + ?- set_print. |
| 39 | + |
| 40 | +To set not to print, use: |
| 41 | + |
| 42 | + ?- set_noprint. |
| 43 | + |
| 44 | +To use AB-dispute derivations, do: |
| 45 | + |
| 46 | + ?- set_ab. |
| 47 | + |
| 48 | +To use GB-dispute derivations, do: |
| 49 | + |
| 50 | + ?- set_gb. |
| 51 | + |
| 52 | +To change strategies, use: |
| 53 | + |
| 54 | + ?- set_strategies(StratList). |
| 55 | + |
| 56 | +StratList has the form: `[T,PA,OA,PS,OS,PR]`. |
| 57 | + |
| 58 | +- turn choice (`T`): |
| 59 | + |
| 60 | + p - proponent priority [DEFAULT] |
| 61 | + o - opponent priority |
| 62 | + |
| 63 | +- argument choice (proponent `PA`, and opponent `OA`): |
| 64 | + |
| 65 | + n - newest |
| 66 | + o - oldest |
| 67 | + s - smallest unmarked support [DEFAULT (prop and opp)] |
| 68 | + l - largest unmarked support |
| 69 | + |
| 70 | +- sentence choice (proponent `PS`, and opponent `OS`): |
| 71 | + |
| 72 | + n - newest |
| 73 | + o - oldest |
| 74 | + e - eager (choose an assumption if possible) |
| 75 | + p - patient (choose non-assumption if poss.) [DEFAULT (prop and opp)] |
| 76 | + |
| 77 | +- proponent rule choice (`PR`): |
| 78 | + |
| 79 | + s - smallest rule body first |
0 commit comments