Inductive Inference of Term Rewriting Systems from Positive Data

  • M. R. K. Krishna Rao
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3244)


In this paper, we study inferability of term rewriting systems from positive examples alone. We define a class of simple flat term rewriting systems that are inferable from positive examples. In flat term rewriting systems, nesting of defined symbols is forbidden in both left- and right-hand sides. A flat TRS is simple if the size of redexes in the right-hand sides is bounded by the size of the corresponding left-hand sides. The class of simple flat TRSs is rich enough to include many divide-and-conquer programs like addition, doubling, tree-count, list-count, split, append, etc. The relation between our results and the known results on Prolog programs is also discussed. In particular, flat TRSs can define functions (like doubling), whose output is bigger in size than the input, which is not possible with linearly-moded Prolog programs.


Function Symbol Inductive Inference Positive Data Semantic Mapping Pattern Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Angluin, D.: Inductive inference of formal languages from positive data. Information and Control 45, 117–135 (1980)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Arimura, H., Shinohara, T., Otsuki, S.: Finding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 649–660. Springer, Heidelberg (1994)Google Scholar
  3. 3.
    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
  4. 4.
    Blum, L., Blum, M.: Towards a mathematical theory of inductive inference. Information and Control 28, 125–155 (1975)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Dershowitz, N., Jouannaud, J.-P.: Rewrite Systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 243–320. North-Holland, Amsterdam (1990)Google Scholar
  6. 6.
    Gold, E.M.: Language identification in the limit. Information and Control 10, 447–474 (1967)zbMATHCrossRefGoogle Scholar
  7. 7.
    Klop, J.W.: Term Rewriting Systems. In: Abramsky, S., Gabby, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science, vol. 1, Oxford Press, Oxford (1992)Google Scholar
  8. 8.
    Krishna Rao, M.R.K.: Some classes of prolog programs inferable from positive data, Theor. Comput. Sci. 241, 211–234 (2000)MathSciNetGoogle Scholar
  9. 9.
    Mukouchi, Y., Yamaue, I., Sato, M.: Inferring a Rewriting System from Examples. In: Arikawa, S., Motoda, H. (eds.) DS 1998. LNCS (LNAI), vol. 1532, pp. 93–104. Springer, Heidelberg (1998)Google Scholar
  10. 10.
    Shinohara, T.: Inductive inference of monotonic formal systems from positive data. New Generation Computing 8, 371–384 (1991)zbMATHCrossRefGoogle Scholar
  11. 11.
    Shinohara, T., Arimura, H.: Inductive inference of unbounded unions of pattern languages from positive data. Theor. Comput. Sci. 241, 191–209 (2000)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • M. R. K. Krishna Rao
    • 1
  1. 1.Information and Computer Science DepartmentKing Fahd University of Petroleum and MineralsDhahranSaudi Arabia

Personalised recommendations