A class of prolog programs inferable from positive data

Abstract

In this paper, we identify a class of Prolog programs inferable from positive data. Our approach is based on moding information and linear predicate inequalities between input terms and output terms. Our results generalize the results of Arimura and Shinohara [4]. Standard programs for reverse, quick-sort, merge-sort are a few examples of programs that can be handled by our results but not by the earlier results of [4]. The generality of our results follows from the fact that we treat logical variables as transmitters for broadcasting communication, whereas Arimura and Shinohara [4] treat them as point-to-point communication channels.