Skip to main content

Algorithmic learning from incomplete information: Principles and problems

  • Chapter 4 Artificial Intelligence
  • Conference paper
  • First Online:
Machines, Languages, and Complexity (IMYCS 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 381))

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dana Angluin and Carl Smith, A survey of inductive inference: theory and methods, Computing Surveys 15 (1983), 237–269

    Google Scholar 

  2. E. Mark Gold, Language identification in the limit, Information and Control 14 (1967), 447–474

    Google Scholar 

  3. Klaus P. Jantke and Hans-Rainer Beick, Combining postulates of naturalness in inductive inference, EIK 17 (1981) 8/9, 465–484

    Google Scholar 

  4. Reinhard Klette and Rolf Wiehagen, Research in the theory of inductive inference by GDR mathematicians — a survey, Inf. Sciences 22 (1980), 149–169

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

J. Dassow J. Kelemen

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jantke, K.P. (1989). Algorithmic learning from incomplete information: Principles and problems. In: Dassow, J., Kelemen, J. (eds) Machines, Languages, and Complexity. IMYCS 1988. Lecture Notes in Computer Science, vol 381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015939

Download citation

  • DOI: https://doi.org/10.1007/BFb0015939

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51516-6

  • Online ISBN: 978-3-540-48203-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics