ADFsys -
ASP based system for ADFs to compute acceptable sets of arguments

Welcome to the ADF system page, for computing acceptable sets of arguments (models) for Abstract Dialectical Frameworks (ADFs)

It is developed within the project "New Methods for Analyzing, Comparing, and Solving Argumentation Problems" (has been funded by the Vienna Science and Technology Fund (WWTF) through project ICT 08-028).

News
About
Download
Team
Related Webpages
References

News

New Version and Website

19.4.2013
The development of an ASP-based system for ADFs continues at a new website and under a new system name: DIAMOND.

Encodings update

24.8.2012
Update of encodings and added link-type detection

Webpage online

10.4.2012

ADFsys is a system for computing models of Abstract Dialectical Frameworks (ADFs) using the answer-set-programming (ASP) paradigm. For certain semantics the system needs to distuingish between the types of links present in an ADF. The general workflow is then to either supply the link types by hand, or run the ASP encoding for finding out these types. Afterwards the linktype result together with the ADF instance can be solved as normal. This specification is mandatory for the admissible sets as well as for the preferred and stable semantics.

Please note that the semantics encoded in ADFsys correspond to the ones given in [1], while DIAMOND encodes semantics given in [4,5].

Download

For the execution of the programs one needs an ASP solver like Gringo/Clasp(D) (see Potassco)

Normal ASP Encodings (only Gringo/Clasp)

cf: cf.dl
admissible: admissible.dl (requires link specification)
model: model.dl
stable: stable_model.dl (requires link specification)

Encondigs using disjunctive ASP (only Gringo/ClaspD)

link-type detection: linktype.dl
well-founded: wf.dl

metasp Encondigs (only Gringo/ClaspD)

For the following encoding the metasp optimization frontend is necessary, which can be downloaded here: metasp.

preferred: preferred.dl (requires link specification)

The call for executing the preferred.dl encoding together with an input.dl is as follows.

$ gringo --reify preferred.dl input.dl | \
          gringo - {meta.lp,metaO.lp,metaD.lp} \ 
          <(echo "optimize(1,1,incl).") | claspD 0

Examples

Here we provied some examples to test the program.

Input format for the ADFsys

   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), xor(p,q), imp(p,q), 
                   iff(p,q) and neg(p) for the usual boolean 
                   connectives and subformulae p and q, nested 
                   as needed.

   optional input
att(x,s)      ...  for stating that the link from x to s is 
                   attacking
sup(x,s)      ...  for stating that the link from x to s is 
                   supporting
att_supp(x,s) ...  for stating that the link from x to s is 
                   uninformative
dep(x,s)      ...  for stating that the link from x to s is 
                   dependent

example01.dl.
example01_l.dl with link types.

The execution of that example for models would then be as follows.

 $ gringo model.dl example01.dl | clasp 0

The 0 option lets the solver output all models.

Here are some further examples:

ADF based on a classical Argumentation Framework (AF):
- example_AF.dl
Joint Attacks:
- example01.dl.
Other:
- example02.dl.
- example03.dl.

Team

Related Webpages

Potassco
ASPARTIX
dynPARTIX
CEGARTIX
Vispartix
arglib.org Towards an argumentation benchmark library

References

[5]	Approximating Operators and Semantics for Abstract Dialectical Frameworks Hannes Strass. In Artificial Intelligence, 205: 39-70, 2013 [ DOI ]
[4]	Abstract Dialectical Frameworks Revisited Gerhard Brewka, Stefan Ellmauthaler, Hannes Strass, Johannes P. Wallner and Stefan Woltran. In Francesca Rossi, editor, Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013), pages 803-809, IJCAI/AAAI, 2013 [ pdf ]
[3]	Abstract Dialectical Frameworks: Properties, Complexity, and Implementation Stefan Ellmauthaler Master's Thesis, Technische Universität Wien, Stefan Woltran and Johannes Peter Wallner advisors, 2012. [ obv ]
[2]	Evaluating Abstract Dialectical Frameworks with ASP (demonstration extended abstract) Stefan Ellmauthaler and Johannes Peter Wallner. In Bart Verheij, Stefan Szeider, and Stefan Woltran, editors, Proceedings of the Fourth International Conference on Computational Models of Argument, COMMA 2012 , volume 245 of Frontiers in Artificial Intelligence and Applications, pages 505-506, Vienna, Austria, September 2012.
[1]	Abstract Dialectical Frameworks Gerd Brewka and Stefan Woltran. In Fangzhen Lin, Ulrike Sattler and Miroslaw Truszczynski, editors, Proceedings of the 12th International Conference on Principles of Knowledge Representation and Reasoning (KR 2010), pages 102–111, AAAI Press, 2010. [ pdf ]

Top

Home / Kontakt / Webmaster / Offenlegung gemäß § 25 Mediengesetz: Inhaber der Website ist das Institut für Logic and Computation 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 / Datenschutzerklärung

ADFsys - ASP based system for ADFs to compute acceptable sets of arguments

Contents