Affiliations: [a] Universidad de las Américas-Puebla. México. [email protected] | [b] Benemérita Universidad Atónoma de Puebla, Facultad de Ciencias de la Computación. México. [email protected] | [c] Benemérita Universidad Atónoma de Puebla, Facultad de Ciencias de la Computación. México. [email protected]
Correspondence:
[*]
Address for correspondence: Facultad de Cs. de la Computación, 14 Sur y Av. San Claudio C.P.72570, Puebla, Puebla, México
Abstract: We extend further the relationship that exists between logic programming semantics and some of the semantics of extensions defined on argumentation frameworks. We define a new logic programming semantics based on the addition of abducible atoms to those normal logic programs that do not have stable models, and consider the argumentation extensions that result from it when using a well-known translation mapping between argumentation frameworks and normal programs. We call this programming semantics the stable m-ab-m logic programming semantics. This semantics defines a new type of semantics of extensions on argumentation frameworks that is not comparable to the semi-stable argumentation semantics, yet both argumentation semantics share several properties, since they both generalize the stable semantics of extensions. We also define a semantics for normal logic programs based on minimal classical two-valued models and the Gelfond-Lifschitz reduct. This semantics corresponds to the semi-stable extensions in argumentation frameworks according to the mapping mentioned before; this way we obtain a general version of a semi-stable semantics for normal logic programs. Each of these new semantics has the property of being non-empty for any normal logic program or argumentation framework, and each of them agrees with the respective stable semantics in the case where the stable semantics is a non-empty set.
