Abstract
There exists many approaches to solve divergence at Knuth-Bendix Completion procedure. One way is to use ideas of inductive inference. TLPS provides a tool for implementing such inference rules. The problem is shown by a simple example and an idea to solve it. Some requirements which a system for its implementation should fullfil are expressed. The introduced small rule is implemented stepwise to show the use of TLPS. Lastly the approach of TLPS is discussed.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Thomas, M. and Jantke, K.P.: Inductive Inference for solving Divergence in Knuth-Bendix Completion, Lecture Notes in AI, Vol. 397, Springer-Verlag, 1989, pp. 288–303
Lange, St. and Jantke, K.P.: Inductive Completion for Transforming of Equational Specifications, Lecture Notes in Comp. Sci., Vol. 534, Springer-Verlag, 1991, pp. 117–140
Goldammer, U.: A method for the inductive synthesis of rewrite programs based on Knuth-Bendix-Completion Techniques, GOSLER Report 06/92
Grieser, G.: TLPS — Eine Einführung
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Grieser, G. (1995). TLPS — A term rewriting laboratory (not only) for experiments in automatic program synthesis. In: Jantke, K.P., Lange, S. (eds) Algorithmic Learning for Knowledge-Based Systems. Lecture Notes in Computer Science, vol 961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60217-8_22
Download citation
DOI: https://doi.org/10.1007/3-540-60217-8_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60217-0
Online ISBN: 978-3-540-44737-5
eBook Packages: Springer Book Archive