YADF -
Dynamic ASP based system for computing acceptable sets of arguments for ADFs
Welcome to the YADF system page, for computing acceptable arguments for Abstract Dialectical Frameworks (ADFs).
It is developed within the project "A Semantical Framework for Graph-Based Argument Processing"
(funded by Deutsche Forschungsgemeinschaft (DFG) and the Austrian Science Fund (FWF) under grants BR-1817/7-2 and I2854 (DFG/
FWF))
Contents
News
YADF 0.1.1 available
7.12.2018A version of YADF also supporting the stable semantics is available. You can download YADF version 0.1.1 below.
Webpage online
16.11.2016YADF webpage with YADF 0.1.0 is online.
About
YADF is a system for solving reasoning problems on Abstract Dialectical Frameworks (ADFs) using dynamic Answer Set Programming (ASP) encodings (see the references below). Given an ADF and reasoning problem as input, the tool YADF returns the encoding of the reasoning problem as an ASP-program for that ADF. A ASP system can then solve the reasoning task. At the moment the system has been tested using the rule decomposition tool lpopt and clingo (4.4.0). YADF has been implemented using Scala. Running YADF requires Java.
Usage
Command line options
A typical call of YADF looks as follows:
- Credulous acceptance of statement/argument "a" with admissible semantics:
java -jar yadf_0.1.1.jar -adm -cred a filename | \ ./path/to/lpopt | ./path/to/clingo
We provide the complete usage (which is subject to change in future versions):
usage: yadf [options] inputfile with options: -h display this help -adm compute the admissible interpretations -com compute the complete interpretations -prf compute the preferred interpretations -stb compute the stable interpretations -cred s check credulous acceptance of statement s -scep s check sceptical acceptance of statement s
Examples
Input format for YADF:
s(x). ... for representing a 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.
For examples see:
Download
Version 0.1.1 of YADF can be downloaded here: YADF version 0.1.1
For the execution of the program one needs a ASP system like clingo. Also using lpopt is recommended for harder instances.Benchmarks
The ADFs generated from metro networks and grids used in the experimental evaluation of [1] are available here: Using the same generator, we have generated ADFs on the basis of AFs that were employed at ICCMA 2017 from the domains ABA2AF, Planning2AF, and Traffic: Acyclic versions of these ADFs can be found here:Team
Related Webpages
References
| [1] |
Solving Advanced Argumentation Problems with Answer-Set Programming Gerhard Brewka, Martin Diller, Georg Heissenberger, Thomas Linsbichler, and Stefan Woltran. In Satinder P. Singh and Shaul Markovitch, editors, Proceedings of the 31st AAAI Conference on Artificial Intelligence, pages 1077-1083. AAAI Press, 2017. [ paper ] |
Top