Studying Ideal Semantics via Logic Programming Semantics
Juan Carlos Nieves, Mauricio Osorio · 2011
In this paper, we show that by using extensions of the Well-Founded Semantics (WFS) which were defined in terms of rewriting systems, one can characterize ideal sets. We also show that these extensions of the well-founded semantics define argumentation semantics with similar behaviour to the ideal argumentation semantics. On the other hand, we introduce a new logic programming semantics which is able to characterize the ideal sets of an argumentation framework.