Preferred Extensions as Minimal Models of Clark's Completion Semantics
Mauricio Osorio, Alejandro Santoyo · Research in Computing Science · 2013
Abstract. Dung established the connections between several logic pro-gramming semantics and various argumentation framework semantics. In this paper we present a characterization of the preferred semantics of argumentation frameworks (which is defined in terms of a maximal admissible set w.r.t. set inclusion) in terms of minimal logic models of Clark’s completion. Additionally, we make use of integer programming for computing preferred extensions by a method defined by Bell et al. [3], which translates a logic program into an integer program which in turn can be solved by an ad hoc solver.