Skip to Content

TU Wien Fakultät für Informatik DBAI Database and Artificial Intelligence Group
Top-level Navigation: Current-level Navigation:

Path: DBAI > research > projects > grappa project > software > QADF

Tools: Print page

     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))



Webpage online

YADF webpage is online. You can download YADF version 0.1.0 below.


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 (2.11). Running YADF requires Java (6+).


Command line options

A typical call of YADF looks as follows:

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
 -cred STATEMENT           check credulous acceptance of STATEMENT
 -scep STATEMENT           check sceptical acceptance of STATEMENT


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:


Version 0.1.0 of YADF can be downloaded here: YADF version 0.1.0

For the execution of the program one needs a ASP system like clingo. Also using lpopt is recommended for harder instances.


Related Webpages


[1] Solving Advanced Argumentation Problems with Answer-Set Programming
Gerhard Brewka, Martin Diller, Georg Heissenberger, Thomas Linsbichler, and Stefan Woltran.
To appear in Proceedings of AAAI 2017.


Home / Kontakt / Webmaster / Offenlegung gemäß § 25 Mediengesetz: Inhaber der Website ist das Institut für Informationssysteme an der Technischen Universität Wien, 1040 Wien. Die TU Wien distanziert sich von den Inhalten aller extern gelinkten Seiten und übernimmt diesbezüglich keine Haftung. / Disclaimer.