Representing Argumentation Frameworks in Answer Set Programming
Chiaki Sakama and Tjitze Rienstra
Fundamneta Informaticae, vol.155(3), pages 261-292, 2017.
This paper studies representation of argumentation frameworks (AFs) in answer set programming (ASP).
Four different transformations from AFs to logic programs are provided under
the complete semantics, stable semantics, grounded semantics and preferred semantics.
The proposed transformations encode labelling-based argumentation semantics in a simple manner, and
different semantics of AFs are uniformly characterized by stable models of transformed programs.
We apply transformed programs to solving AF problems such as query-answering,
enforcement of arguments, agreement or equivalence of different AFs.
Logic programming encodings of AFs are also used for
representing assumption-based argumentation (ABA) in ASP.
The results of this paper exploit new connections between argumentation theory and logic programming,
and enable one to perform various argumentation tasks using existing answer set solvers.
Full Paper (pdf 205K)