Relating defeasible and normal logic programming through transformation properties. (Q1853599)

This paper relates the Defeasible Logic Programming (DeLP) framework and its semantics SEM\(_{\text{DeLP}}\) to classical logic programming frameworks. In DeLP, we distinguish between two different sorts of rules: strict and defeasible rules. Negative literals (\(\sim A)\) in these rules are considered to represent classical negation. In contrast to this, in Normal Logic Programming (NLP), there is only one kind of rules, but the meaning of negative literals (not \(A)\) is different: they represent a kind of negation as failure, and thereby introduce defeasibility. Various semantics have been defined for NLP, notably the well-founded semantics (WFS) and the stable semantics Stable. In this paper we consider the transformation properties for NLP introduced by \textit{S. Brass} and \textit{J. Dix} [J. Log. Program. 40, 1--46 (1999; Zbl 0946.68088)] and suitably adjusted for the DeLP framework. We show which transformation properties are satisfied, thereby identifying aspects in which NLP and DeLP differ. We contend that the transformation rules presented in this paper can help to gain a better understanding of the relationship of DeLP semantics with respect to more traditional logic programming approaches. As a byproduct, we obtain the result that DeLP is a proper extension of NLP.