Preference-Based Argumentation Capturing Prioritized Logic Programming

First, we present a novel approach to an abstract preference-based argumentation framework (an abstract PAF), which generalizes Dung's abstract argumentation framework (AF) to deal with additional preferences over a set of arguments. In our formalism, the semantics of such a PAF is given as P-extensions that are selected from extensions of acceptability semantics by taking into account such preferences. Second, using a prioritized logic program (PLP) capable of representing priority information along with integrity constraints, the proposed method defines the non-abstract preference-based argumentation framework (the non-abstract PAF) translated from a PLP, whose semantics is also given by P-extensions instantiating those of an abstract one. Finally we show the interesting result that, P-extensions of such a non-abstract PAF under stable semantics capture preferred answer sets of a PLP, which ensures the advantages as well as the correctness of our approach.