The stable-abducible argumentation semantics

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 this way we define a new argumentation semantics called stable abducible which lies in between the stable and the preferred semantics. The relevance of this new semantics is that it is nonempty for any argumentation framework, and coincides with the stable argumentation semantics whenever this is non-empty. We study some of the properties of this semant.Peer ReviewedPostprint (published version

Commonsense axiomatizations for logic programs

AbstractVarious semantics for logic programs with negation are described in terms of a dualized program together with additional axioms, some of which are second-order formulas. The semantics of Clark, Fitting, and Kunen are characterized in this framework, and a finite first-order presentation of Kunen's semantics is described. A new axiom to represent “commonsense” reasoning is proposed for logic programs. It is shown that the well-founded semantics and stable models are definable with this axiom. The roles of domain augmentation and domain closure are examined. A “domain foundation” axiom is proposed to replace the domain closure axiom