Computing Argumentation Semantics in Answer Set Programming

We propose a simple and generic method for computing Dung's standard argumentation semantics along with semi-stable semantics in Answer Set Programming (ASP). The different semantics captured by argumentation frameworks are all uniformly represented in our ASP setting. It is based on Caminada's reinstatement labellings for argumentation frameworks as well as our method of computing circumscription in ASP. In our approach, a given argumentation framework is translated into a single normal logic program w.r.t. the chosen semantics whose answer set (if exists) yields an argument-based extension expressed by means of a reinstatement labelling for the semantics. We show soundness and completeness theorems for our translation, which allow us not only to compute argument-based extensions but also to decide whether an argument is sceptically or credulously accepted w.r.t. the chosen semantics. Based on our theorems, the prototype argumentation system was implemented using the ASP solver, DLV, whose evaluation results verified correctness of our approach.