Support Enforcement
This webpage is about a system for a prototype for support enforcement on abstract dialectical frameworks.
About
This webpage is about an implementation for support enforcement via answer-set programming (ASP). The implementation is based on goDiamond, which is distributed under GNU GPL license.Extended paper with proof details
Can be found here.Usage
This software consists of ASP modules (see Download), which are to be called via clingo (v4.4.0). We give here preliminary usage:./CLINGO adm.lp pf2fn.lp show.lp enforcement.lp fnop.lp instance.lp
Example
Let us consider the following input file containing the definition of an ADF:
s(a). s(b). s(c). ac(a,b). ac(b,c). ac(c,c(f)).
Now, say we want to enforce a to be true:
enf(a,true).
With this input, support enforcement will state that it is possible to enforce a to be true via supports. The technical output is:
newlink(c) changedmodel(c,0) t(a) t(b) t(c)
Which states that there should be a new link (from the expanded argument) onto c. The acceptance condition of c is changed by changing one entry. The original entries of the acceptance condition of c (truth table) are unchanged (ie if c is false), what this output says is which entry should differ when c is true. The original models/non-models are ordered, and the index (here 0) says which value shall be flipped. In this simple example this means an unsatisfiable condition changes to "x", for new argument x. The last values denote the admissible interpretation of the original arguments (all true in this case).
Download
Here we provide the necessary ASP modules (all of them are required). The modules are adapted from the Diamond system suite and inherit their GPL license.
Instances are available here (ADFs from here and generated enforcement requests).References
| [1] |
Structural Constraints for Dynamic Operators in Abstract Argumentation Johannes P. Wallner Proc. of COMMA 2018. |
Top