Compiling associativity into logic programs

Abstract

We show how a simple but important class of recursive logic programs can be mechanically transformed to take advantage of the associativity of auxiliary relations. This often results in improved efficiency through the introduction of tail recursion. We give proofs of correctness both for the transformation and for a number of useful specializations of it. Finally we show how the transformation can be given an interpretation based on difference structures.