Skip to main content

Inductive synthesis of term rewriting systems

  • Inductive Synthesis Of Programs
  • Conference paper
  • First Online:
Baltic Computer Science (BCS 1991)

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

Included in the following conference series:

Abstract

Fast algorithm for inductive synthesis of term rewriting systems is described and proved to be correct. It is implemented and successfully applied for inductive synthesis of different algorithms, including the binary multiplication. The algorithm proposed supports automatic learning process and can be used for designing and implementation of ADT.

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. D.Angluin, Easily inferred sequences, Memorandum No. ERL-M499, University of California, 1974.

    Google Scholar 

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

    Article  Google Scholar 

  3. D. Angluin, Finding patterns common to a set of strings, J.Comput. Syst. Sci., 21, 46–62, 1980.

    Article  Google Scholar 

  4. J.M.Barzdin and G.J.Barzdin, Rapid construction of algebraic axioms from samples, (Will appear in North-Holland) 1990.

    Google Scholar 

  5. G. Barzdin, Inductive synthesis of encoding for algebraic data types, Lect. Notes Artif. Intelligence 397, 328–338, 1989.

    Google Scholar 

  6. J.M. Barzdin, Some rules of inductive inference and their use for program synthesis, Information Processing 83, 333–338, Amsterdam, North-Holland, 1983.

    Google Scholar 

  7. L.G.Bouma and H.R.Walters, Implementing algebraic specifications, Algebraic specification, ACM Press frontier series,. 1989.

    Google Scholar 

  8. A.W. Biermann and R. Krishnaswamy, Constructing programs from example computations, IEEE Trans.Software Eng. 2, 141–153, 1976.

    Google Scholar 

  9. A.W. Biermann, The inference of regular LISP programs from examples, IEEE Trans. Systems Man Cybernet. 8, 585–600, 1978.

    Google Scholar 

  10. A. Brazma and E.B. Kinber, Generalized regular expressions — a language for synthesis of programs with branching in loops, Theor. Comp. Sci. 46, 175–195, 1986.

    Article  Google Scholar 

  11. S. Crespi-Reghizzi, An effective model for grammar inference, Information Processing 71, New York, North-Holland, 524–529, 1972.

    Google Scholar 

  12. N. Dershowitz, Termination of Rewriting, Symbolic Computation 3, 69–116, 1987.

    Google Scholar 

  13. E.M. Gold, Language identification in the limit, Information and control 10, 447–474, 1967.

    Article  Google Scholar 

  14. S. Lange, Towards a set of inference rules for solving divergence in Knuth-Bendix completion, Lect. Notes Artificial Intelligence 397, 304–316, 1989.

    Google Scholar 

  15. E.Shapiro, Algorithmic program debugging, Cambridge(Mas.) MIT Press, 1983.

    Google Scholar 

  16. P.D. Summers, A Methodology for LISP program construction from examples, J. ACM 24-1, 161–175, 1977.

    Article  Google Scholar 

  17. M. Thomas and K.P. Jantke, Inductive inference for solving divergence in Knuth-Bendix completion, Lect. Notes Artificial Intelligence 397, 288–303, 1989.

    Google Scholar 

  18. T. Yokomori, Learning context-free languages efficiently, Lect. Notes Artificial Intelligence 397, 104–123, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Janis Bārzdinš Dines Bjørner

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barzdins, G. (1991). Inductive synthesis of term rewriting systems. In: Bārzdinš, J., Bjørner, D. (eds) Baltic Computer Science. BCS 1991. Lecture Notes in Computer Science, vol 502. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019361

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54131-8

  • Online ISBN: 978-3-540-47427-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics