Skip to main content
SpringerLink
Log in

ADT implementation and completion by induction from examples

  • Conference paper
  • First Online:
Recent Trends in Data Type Specification (ADT 1990)

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

Included in the following conference series:

Abstract

There exists a fast algorithm [2] for inductive synthesis of terminating and ground confluent term rewriting systems from samples. The principles of this algorithm and the methodology of its use for implementation and completion of abstract data types are described.

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. D. Angluin and C.H. Smith, Inductive Inference: Theory and Methods, Computing Surveys 15, 237–264, 1983.

    Article  Google Scholar 

  2. G.Barzdins, Inductive synthesis of term rewriting systems, In: Baltic Computer Science, Lecture Notes in Computer Science; Springer Verlag 1991 (to appear).

    Google Scholar 

  3. J.M.Bardzin and G.J.Barzdin, Rapid construction of algebraic axioms from samples, In: Images of Programming; North-Holland 1991 (to appear).

    Google Scholar 

  4. G.Huet and D.C.Oppen, Equations and Rewrite Rules: A Survey. In (Book, R., ed.) Formal Language theory: Perspectives and Open Problems, 349–405, 1980.

    Google Scholar 

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

    Google Scholar 

  6. E.W. Dijkstra, A note on two problems in connection with graphs, Numerische Math 1, 269–271, 1959.

    Article  Google Scholar 

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

    Google Scholar 

  8. A.Togashi and S.Noguchi, Inductive inference of term rewriting systems realizing algebras, Proceedings of the Workshop on Algorithmic Learning Theory (North-Holland), 411–423, 190.

    Google Scholar 

Download references

Author information

Author notes

  1. Guntis Barzdins

    Present address: Department of Computer Science, New Mexico State University, USA

Authors and Affiliations

  1. Institute of Mathematics and Computer Science, University of Latvia, Rainis blvd. 29, 226250, Riga, Latvia

    Guntis Barzdins

Authors
  1. Guntis Barzdins
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

H. Ehrig K. P. Jantke F. Orejas H. Reichel

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barzdins, G. (1991). ADT implementation and completion by induction from examples. In: Ehrig, H., Jantke, K.P., Orejas, F., Reichel, H. (eds) Recent Trends in Data Type Specification. ADT 1990. Lecture Notes in Computer Science, vol 534. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54496-8_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-54496-8_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation