Logic programming without default negation revisited

Abstract

We present a reformulation of the framework of logic programming without default negation, first suggested by (Kakas et al., 1994). The resulting formalism is called priority logic programming. Under this formulation, priority is a simple concept: that a rule r of higher priority than r' means the application of r blocks that of r'. We present a transformation from normal logic programs to priority programs and study the relationships between priority logic programming and various semantics for logic programs with negation.