Skip to main content
SpringerLink
Log in

Inductive inference for solving divergence in Knuth-Bendix completion

  • Submitted Papers
  • Conference paper
  • First Online:
Analogical and Inductive Inference (AII 1989)

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

Included in the following conference series:

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, C.H. Smith, A survey of inductive inference: theory and methods, Computing Surveys 15 (1983) 3, pp.237–269.

    Google Scholar 

  2. J.M. Barzdin, Some rules of inductive inference and their use for program synthesis, Proc. IFIP 9th World Congress,Paris, 1983, R.E.A. Mason (ed.), North-Holland, 1983, pp. 333–336.

    Google Scholar 

  3. H. Ehrig, B. Mahr, Fundamentals of Algebraic Specification1, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1985

    Google Scholar 

  4. G. Huet, D. Oppen, Equations and Rewrite Rules: A Survey, in Formal Language Theory: Perspectives and Open Problems, R. Book (ed.) pp.349–405, Academic Press, New York, 1980.

    Google Scholar 

  5. H. Kirchner, Schematization of infinite sets of rewrite rules. Application to the divergence of completion processes, in Proc. Rewriting Techniques and Applications, P. Lescanne (ed.), Lecture Notes in Computer Science 256, Springer-Verlag, 1987, pp. 180–191.

    Google Scholar 

  6. Y. Kodratoff, Generalizing and particularising as the techniques of learning, Proc. 2nd Int. Symp. on Artif. Intell. and Inf. Control Systems of Robots, Smolenice, Czech., I. Plander (ed.), North-Holland,1982, pp. 131–134.

    Google Scholar 

  7. D. E. Knuth, P. B. Bendix, Simple Word Problems in Universal Algebras, Computational Algebra, J. Leach (ed.), Pergammon Press 1970.

    Google Scholar 

  8. St. Lange, A decidability problem of Church-Rosser specifications for program synthesis, Proc. Analogical and Inductive Inference, Wendisch-Rietz, GDR, K.P. Jantke (ed.), Lecture Notes in Computer Science 265, Springer-Verlag, 1987, pp.105–124.

    Google Scholar 

  9. G.D Plotkin, Automatic Methods of Inductive Inference, Ph.D. Thesis, Edinburgh University, 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computing Science, Lilybank Gardens, University of Glasgow, G12, Glasgow, Scotland

    Muffy Thomas

  2. Dept. of Mathematics & Informatics, Leipzig University of Technology, P.O. Box 66, 7030, Leipzig, German Democratic Republic

    Klaus P. Jantke

Authors
  1. Muffy Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Klaus P. Jantke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Klaus P. Jantke

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thomas, M., Jantke, K.P. (1989). Inductive inference for solving divergence in Knuth-Bendix completion. In: Jantke, K.P. (eds) Analogical and Inductive Inference. AII 1989. Lecture Notes in Computer Science, vol 397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51734-0_69

Download citation

  • DOI: https://doi.org/10.1007/3-540-51734-0_69

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51734-4

  • Online ISBN: 978-3-540-46798-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation