A Class of Prolog Programs with Non-linear Outputs Inferable from Positive Data
In this paper, we study inferability of Prolog programs from positive examples alone. We define a class of Prolog programs called recursion bounded programs that can capture non-linear relationships between inputs and outputs and yet inferable from positive examples. This class is rich enough to include many programs like append, delete, insert, reverse, permute, count, listsum, listproduct, insertion-sort, quick-sort on lists, various tree traversal programs and addition, multiplication, factorial, power on natural numbers. The relation between our results and the known results is also discussed. In particular, the class of recursion bounded programs contains all the known terminating linearly-moded Prolog programs of Krishna Rao  and additional programs like power on natural numbers which do not belong to the class of linearly-moded programs and the class of safe programs of Martin and Sharma .
KeywordsLogic Program Inductive Inference Positive Data Semantic Mapping Safe Program
Unable to display preview. Download preview PDF.
- 3.Arimura, H., Shinohara, T., Otsuki, S.: In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 649–660. Springer, Heidelberg (1994)Google Scholar
- 4.Arimura, H., Shinohara, T.: Inductive inference of Prolog programs with linear data dependency from positive data. In: Proc. Information Modelling and Knowledge Bases V, pp. 365–375. IOS press, Amsterdam (1994)Google Scholar
- 9.Krishna Rao, M.R.K., Shyamasundar, R.K.: Unification-free execution of well-moded Prolog programs. In: Mycroft, A. (ed.) SAS 1995. LNCS, vol. 983, pp. 243–260. Springer, Heidelberg (1995)Google Scholar
- 11.Martin, E.: Personal communication (2005)Google Scholar
- 13.Shapiro, E.: Inductive inference of theories from facts, Tech. Rep., Yale Univ. (1981)Google Scholar
- 14.Shapiro, E.: Algorithmic Program Debugging. MIT Press, Cambridge (1983)Google Scholar