Skip to main content

A unifying approach to monotonic language learning on informant

  • Submitted Papers
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 642))

Abstract

The present paper deals with strong-monotonic, monotonic and weak-monotonic language learning from positive and negative examples. The three notions of monotonicity reflect different formalizations of the requirement that the learner has to produce always better and better generalizations when fed more and more data on the concept to be learnt.

We characterize strong-monotonic, monotonic, weak-monotonic and finite language learning from positive and negative data in terms of recursively generable finite sets. Thereby, we elaborate a unifying approach to monotonic language learning by showing that there is exactly one learning algorithm which can perform any monotonic inference task.

This research has been supported by the German Ministry for Research and Technology (BMFT) under grant no. 01 IW 101.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Angluin, D., (1980), Inductive Inference of Formal Languagues from Positive Data, Information and Control 45, 117–135

    Google Scholar 

  2. Angluin, D. and C.H. Smith, (1983), Inductive Inference: Theory and Methods, Computing Surveys 15, 3, 237–269

    Google Scholar 

  3. Angluin, D. and C.H. Smith, (1987), Formal Inductive Inference, In Encyclopedia of Artificial Intelligence, St.C. Shapiro (Ed.), Vol. 1, pp. 409–418, Wiley-Interscience Publication, New York

    Google Scholar 

  4. Blum, L. and M. Blum, (1975), Toward a Mathematical Theory of Inductive Inference, Information and Control 28, 122–155

    Google Scholar 

  5. Bucher, W. and H. Maurer, (1984), Theoretische Grundlagen der Programmiersprachen, Automaten und Sprachen, Bibliographisches Institut AG, Wissenschafts-verlag, Zürich

    Google Scholar 

  6. Case, J., (1988), The Power of Vacillation, In Proc. 1st Workshop on Computational Learning Theory, D. Haussler and L. Pitt (Eds.), pp. 196–205, Morgan Kaufmann Publishers Inc.

    Google Scholar 

  7. Case, J. and C. Lynes, (1982), Machine Inductive Inference and Language Identification, Proc. Automata, Languages and Programming, Ninth Colloquim, Aarhus, Denmark, M.Nielsen and E.M. Schmidt (Eds.), Lecture Notes in Computer Science 140, pp. 107–115, Springer-Verlag

    Google Scholar 

  8. Freivalds, R., Kinber, E. B. and R. Wiehagen, (1989), Inductive Inference from Good Examples, Proc. International Workshop on Analogical and Inductive Inference, October 1989, Reinhardsbrunn Castle, K.P. Jantke (Ed.), Lecture Notes in Artificial Intelligence 397, pp. 1–17, Springer-Verlag

    Google Scholar 

  9. Freivalds, R., Kinber, E. B. and R. Wiehagen, (1992), Convergently versus Divergently Incorrect Hypotheses in Inductive Inference, GOSLER Report 02/92, January 1992, Fachbereich Mathematik und Informatik, TH Leipzig

    Google Scholar 

  10. Fulk, M.,(1990), Prudence and other Restrictions in Formal Language Learning, Information and Computation 85, 1–11

    Google Scholar 

  11. Gold, M.E., (1967), Language Identification in the Limit, Information and Control 10, 447–474

    Google Scholar 

  12. Jain, S. and A. Sharma, (1989), Recursion Theoretic Characterizations of Language Learning, The University of Rochester, Dept. of Computer Science, TR 281

    Google Scholar 

  13. Jantke, K.P., (1991A), Monotonic and Non-monotonic Inductive Inference, New Generation Computing 8, 349–360

    Google Scholar 

  14. Jantke, K.P., (1991B), Monotonic and Non-monotonic Inductive Inference of Functions and Patterns, Proc. First International Workshop on Nonmonotonic and Inductive Logics, December 1990, Karlsruhe, J.Dix, K.P. Jantke and P.H. Schmitt (Eds.), Lecture Notes in Artificial Intelligence 543, pp. 161–177, Springer-Verlag

    Google Scholar 

  15. Lange, S. and R. Wiehagen, (1991), Polynomial-Time Inference of Arbitrary Pattern Languages, New Generation Computing 8, 361–370

    Google Scholar 

  16. Lange, S. and T. Zeugmann, (1991), Monotonic versus Non-monotonic Language Learning, in Proc. 2nd International Workshop on Nonmonotonic and Inductive Logic, December 1991, Reinhardsbrunn, to appear in Lecture Notes in Artificial Intelligence

    Google Scholar 

  17. Lange, S. and T. Zeugmann, (1992A), On the Power of Monotonic Language Learning, GOSLER-Report 05/92, February 1992, Fachbereich Mathematik und Informatik, TH Leipzig

    Google Scholar 

  18. Lange, S. and T. Zeugmann, (1992B), Types of Monotonic Language Learning and Their Characterizations, in Proc. 5th ACM Workshop on Computational Learning Theory, July 1992, Morgan Kaufmann Publishers Inc.

    Google Scholar 

  19. Mukouchi, Y., (1991), Definite Inductive Inference as a Successful Identification Criterion, Research Institute of Fundamental Information Science, Kyushu University 33, Fukuoka, December 24, '91 RIFIS-TR-CS-52

    Google Scholar 

  20. Osherson, D., Stob, M. and S. Weinstein, (1986), Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists, MIT-Press, Cambridge, Massachusetts

    Google Scholar 

  21. Solomonoff, R., (1964), A Formal Theory of Inductive Inference, Information and Control 7, 1–22, 234–254

    Google Scholar 

  22. Trakhtenbrot, B.A. and Ya.M. Barzdin, (1970), Konetschnyje Awtomaty (Powedenie i Sintez), Nauka, Moskwa (in Russian)

    Google Scholar 

  23. Wiehagen, R., (1976), Limes-Erkennung rekursiver Funktionen durch spezielle Strategien, J. Information Processing and Cybernetics (EIK) 12, 93–99

    Google Scholar 

  24. Wiehagen, R., (1977), Identification of Formal Languages, Proc. Mathematical Foundations of Computer Science, Tatranska Lomnica, J. Gruska (Ed.), Lecture Notes in Computer Science 53, pp. 571–579, Springer-Verlag

    Google Scholar 

  25. Wiehagen, R., (1991), A Thesis in Inductive Inference, in Proc. First International Workshop on Nonmonotonic and Inductive Logic, December 1990, Karlsruhe, J.Dix, K.P. Jantke and P.H. Schmitt (Eds.), Lecture Notes in Artificial Intelligence 543, pp. 184–207

    Google Scholar 

  26. Wiehagen, R. and W. Liepe, (1976), Charakteristische Eigenschaften von erkennbaren Klassen rekursiver Funktionen, Journal of Information Processing and Cybernetics (EIK) 12, 421–438

    Google Scholar 

  27. Zeugmann, T., (1983), A-posteriori Characterizations in Inductive Inference of Recursive Functions, Journal of Information Processing and Cybernetics (EIK) 19, 559–594

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Klaus P. Jantke

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lange, S., Zeugmann, T. (1992). A unifying approach to monotonic language learning on informant. In: Jantke, K.P. (eds) Analogical and Inductive Inference. AII 1992. Lecture Notes in Computer Science, vol 642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56004-1_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-56004-1_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56004-3

  • Online ISBN: 978-3-540-47339-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics