Skip to main content
SpringerLink
Log in

Learning on the basis of a polynomial pattern synthesis algorithm

  • Contributed Papers
  • Conference paper
  • First Online:
Mathematical Methods of Specification and Synthesis of Software Systems '85 (MMSSS 1985)

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

  • 145 Accesses

Abstract

The proposed system may be used as an intelligent component of any relational DBMS. It should be quite useful in restructuring rapidly changing data bases and in the entry process of large bodies of information, some of it possibly not exactly specified before.

It should be possible to speed up the work of the system by using an enconding procedure for the inputs (cf./5/). In this case changes are to be made in the PSAn, since it would operate with a potentially infinite alphabet.

The system is currently been implemented on a SM-4 minicomputer (PDP-11 compatible) in LISP with the prospect to carry it over to a more powerful minicomputer, thus increasing speed and attractivity.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Angluin, D.: "Finding Patterns Common to a Set of Strings", J. of Computer and System Sciences 21(1980) 1

    Google Scholar 

  2. Jantke, K.P.: "Polynomial Time Inference of General Pattern Languages", Proceedings of STACS '84, Paris, LINCS 166

    Google Scholar 

  3. Martin, J.: "Computer Data-Base Organization", Prentice-Hall, 1977

    Google Scholar 

  4. Shapiro, E.: "Inductive Inference of Theories from Facts", Res. Report 192, Dept. Comp. Sci., Yale University, 1981

    Google Scholar 

  5. Shinohara, T.: Polynomial Time Inference of Extended Regular Pattern Languages", RIMS Symposia on Software Science and Engineering, Kycto, 1982, LINCS 147

    Google Scholar 

  6. Winston, P.: "Artificial Intelligence", Addison-Wesley, 1977

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of Mathematical Linguistics, Institute of Mathematics, P.O.B. 373, Sofia

    Ognian Botusharov

Authors
  1. Ognian Botusharov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wolfgang Bibel Klaus P. Jantke

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Botusharov, O. (1986). Learning on the basis of a polynomial pattern synthesis algorithm. In: Bibel, W., Jantke, K.P. (eds) Mathematical Methods of Specification and Synthesis of Software Systems '85. MMSSS 1985. Lecture Notes in Computer Science, vol 215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16444-8_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-16444-8_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16444-9

  • Online ISBN: 978-3-540-39784-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation