Advertisement

Inductive learning of recurrence-term languages from positive data

  • Phil Watson
1 Inductive Inference Theory 1.2 Inductive Inference of Formal Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 961)

Abstract

We show that the class of languages generated by (basic) recurrence-terms is inferable in the limit from positive data, and that such learning may be consistent and conservative, though not in general strong monotonic. This class of languages has neither of the properties of finite thickness and finite elasticity usually used to prove inferability from positive data, so our proof method is the explicit construction of a tell-tale function for the class of recurrence-term languages. Recurrence-terms are of interest because they generate many sequences arising from divergent cases of Knuth-Bendix completion.

Keywords

Inductive inference from text recurrence-term languages 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [An80]
    D. Angluin, Inductive inference of formal languages from positive data, Information and Control 45, 117–135, 1980.Google Scholar
  2. [AS83]
    D. Angluin, C.H. Smith, Inductive inference: theory and methods, Computing Surveys 15, 237–269, 1983.Google Scholar
  3. [CHK90]
    H. Chen, J. Hsiang, H.-C. Kong, On finite representations of infinite sets of terms, in Proc. of the Second International Workshop on Typed and Conditional Rewrite Systems, Montreal 1990, Lecture Notes in Computer Science 516, 100–114, Springer-Verlag, 1990.Google Scholar
  4. [De85]
    N. Dershowitz, Synthesis by completion, in Proc. 9th International Joint Conference on Artificial Intelligence, Los Angeles, CA, 1985.Google Scholar
  5. [DP90]
    N. Dershowitz, E. Pinchover, Inductive synthesis of equational programs, in Proc. of AIII-90, 1990.Google Scholar
  6. [Go67]
    E.M. Gold, Language identification in the limit, Information and Control 10, 447–474, 1967.Google Scholar
  7. [ISO88]
    International Organisation for Standardisation, Information processing systems — open systems interconnection — LOTOS — a formal description technique based on the temporal ordering of observational behaviour, 1988.Google Scholar
  8. [Ja91]
    K.P. Jantke, Monotonic and non-monotonic inductive inference, New Generation Computing 8, 349–360.Google Scholar
  9. [KB70]
    D. Knuth, P. Bendix, Simple word problems in universal algebra, in J. Leech (Ed.), Computational Problems in Abstract Algebra, Pergamon Press, 1970.Google Scholar
  10. [La89]
    St. Lange, Towards a set of inference rules for solving divergence in Knuth-Bendix completion, in K.P. Jantke (Ed.), Proc. Analogical and Inductive Inference '89, GDR, Lecture Notes in Computer Science 397, 304–316, Springer-Verlag, 1989.Google Scholar
  11. [LZ93]
    St. Lange, T. Zeugmann, Monotonic versus non-monotonic language learning, in G. Brewka, K.P. Jantke and P. H. Schmitt (Eds.), Proc. Second International Workshop on Nonmonotonic and Inductive Logics, Reinhardsbrunn 1991, Lecture Notes in Artificial Intelligence, 659, 254–269, Springer-Verlag, 1993.Google Scholar
  12. [MS90]
    T. Motoki, T. Shinohara, Correct definition of finite elasticity, Technical Report RIFIS-TR-CS-29, Kyushu University, 1990.Google Scholar
  13. [Sh82]
    T. Shinohara, Polynomial time inference of extended regular pattern languages, in Proc. RIMS Symposia on Software Science and Engineering, Kyoto, 1982, Lecture Notes in Computer Science 147, 115–127, Springer-Verlag, 1982.Google Scholar
  14. [Sh91]
    T. Shinohara, Inductive inference of monotonic formal systems from positive data, New Generation Computing 8, 371–384, 1991.Google Scholar
  15. [TJ89]
    M. Thomas, K.P. Jantke, Inductive inference for solving divergence in Knuth-Bendix completion, in K.P. Jantke (Ed.), Proc. Analogical and Inductive Inference '89, GDR, Lecture Notes in Computer Science 397, 288–303, Springer-Verlag, 1989.Google Scholar
  16. [TW93]
    M. Thomas, P. Watson, Solving divergence in Knuth-Bendix completion by enriching signatures, Theoretical Computer Science 112, 145–185, 1993.Google Scholar
  17. [Wa92]
    P. Watson, The expressive power of recurrence-terms, University of Glasgow, Department of Computing Science technical report FM 92-6, 1992.Google Scholar
  18. [Wata]
    P.Watson, Inductive learning of extended pattern languages from text, to appear.Google Scholar
  19. [Wi91]
    R. Wiehagen, A Thesis in inductive inference, in J. Dix, K.P. Jantke and P.H. Schmitt (Eds.), Proc. First International Workshop on Nonmonotonic and Inductive Logics, Karlsruhe 1990, Lecture Notes in Artificial Intelligence, 543, 184–207, Springer-Verlag, 1991.Google Scholar
  20. [Wr89]
    K. Wright, Identification of unions of languages drawn from an identifiable class, Proc. 2nd Workshop Comput. Learning Theory, 328–333, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Phil Watson
    • 1
  1. 1.FB Mathematik und Informatik PF 66HTWK LeipzigLeipzig

Personalised recommendations