Welcome to the QADF system page, for computing acceptable sets of arguments (models and interpretations) for Abstract Dialectical Frameworks (ADFs)
It is developed within the project "Abstract Dialectical Frameworks: Advanced Tools for Formal Argumentation"
(funded by Deutsche Forschungsgemeinschaft (DFG) and the Austrian Science Fund (FWF) under grants BR-1817/7-1 and I1102 (DFG/
FWF)
First of all, let us take a look on a typical program call:
scala qadf_2.9.3-1.0.jar -adm -C a filename | \ ./path/to/bloqqer | ./path/to/depqbf
We provide the complete usage (which is subject to change in future versions):
usage: qadf [options] inputfile with options: -h display this help -3m three valued models -2m two valued models -adm admissible -comp complete -pref preferred -ground ground -E existence -N non trivial existence -C statement credulous acceptance -S statement skeptical acceptance -O outputfile print output to outputfileDefault mode is print encoding of enumeration problem of selected semantics to standard output
Here we provide some examples to test the program.
Input format for QADF required input statement(x) ... for representing an argument/statement called "x" ac(x,f) ... for the acceptance condition f of x which is encoded in propositional logic using the following syntax: c(v), c(f) for true, false and(p,q), or(p,q) and neg(p) for the usual boolean connectives and subformulae p and q, nested as needed.
QADF version 0.1 can be downloaded here: QADF version 0.1
For the execution of the programs one needs a QBF solver like DepQBF.
[2] |
Reasoning in Abstract Dialectical Frameworks Using Quantified Boolean Formulas Martin Diller, Johannes P. Wallner and Stefan Woltran. In Proceedings of the 5th International Conference on Computational Models of Argument, COMMA 2014 |
[1] |
Solving Reasoning Problems on Abstract Dialectical Frameworks via Quantified Boolean Formulas Martin Diller Master's Thesis, Technische Universität Wien, Stefan Woltran and Johannes P. Wallner advisors, 2014. |