Applying SLD-resolution to a class of non-Horn logic programs

Abstract

Methods for dealing with a Horn logic program and one goal are well-known and successful. Here we are concerned with treating logic programs enhanced by some negative literals using the same methods, in particular SLD-resolution. We describe the approach and show its correctness. The result can be applied to default reasoning and has some relevance for model elimination based theorem proving.