Using Answer Set Programming for an scalable implementation of Defeasible Argumentation

In [2] a recursive warrant semantics for Defeasible Logic Programming extended with levels of possibilistic uncertainty for defeasible rules was introduced. The resulting argumentation framework, called RP-DeLP, is based on a general notion of collective (non-binary) conflict among arguments allowing to ensure direct and indirect consistency properties with respect to the strict knowledge. In this paper we propose an efficient and scalable implementation of an interpreter for RP-DeLP using Answer Set Programming (ASP) encodings for the two main queries of the system: looking for valid arguments and finding collective conflicts among arguments. We perform an experimental evaluation of our ASP approach and we compare the results with a previously proposed SAT based approach. The results show that with ASP we are able to scale up to bigger problem instances.