Inferring preferred extensions by Pstable semantics

Abstract

Given an argumentation framework AF, we present a normal program Psi_{AF}, such that the preferred extensions of AF correspond exactly with the pstable models of Psi_{AF}. Moreover, we motivate the notion of suitable codifications for developing metainterpreters of argumentation theory based on logic programming.Postprint (published version