On Transformations into Linear Database Logic Programs

We consider the problem of transformations of logic pro grams without function symbols database logic programs into a special subclass namely linear logic programs Linear logic programs are de ned to be the programs whose rules have at most one intentional atom in their bodies a We investigate linearizability of several syntactically de ned subclasses of programs and present both positive and negative results i e demonstrate programs that cannot be transformed into a lin ear program by any transformation technique and b We develop an algorithm which transforms any program in a speci c subclass namely the piecewise logic programs into a linear logic program