Non-Discriminating Arguments and Their Uses

We present a technique for identifying predicate arguments that play no role in determining the control flow of a logic program with respect to goals satisfying given mode and sharing restrictions.  We call such arguments non-discriminating arguments. We show that such arguments can be detected by an automatic analysis. Following this, we define a transformation procedure, called discriminator slicing, that removes the non-discriminating arguments, resulting in a program whose computation trees are isomorphic to those of the original program.  Finally, we show how the results of the original program can be reconstructed from trace of the transformed program with the original arguments.   Thus the overall result is a two-stage execution of a program, which can be applied usefully in several contexts;  we describe a case study in optimising computations in the probabilistic logic program language PRISM, and discuss applications in tabling and partial evaluation.  We also discuss briefly other possible ways of exploiting the non-discriminating arguments.