We present an overview on how to perform non-monotonic reasoning based on paraconsistent logics. In particular, we show that one can define a logic programming semantics based on the paraconsistent logic G’3 which is called ...

We look at a general way of inducing semantics in argumentation theory by means of a mapping defined on the family of 2-valued models of a normal program, which is constructed in terms of the argumentation framework. In ...