Abstract
First the existence and learnability of rewrite programs representing certain infinite, canonical ground rewrite systems (consisting of input/output examples as rewrite rules) is investigated. The second part contains an experimental synthesis algorithm for rewrite programs which is based on the instantiation and combination of simple (rewrite) program schemes.
This work has been supported by the German Ministry for Research and Technology (BMFT) under grant no. 01 IW 101.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Dana Angluin and Carl H. Smith. A Survey of Inductive Inference: Theory and Methods. Computing Surveys, 15:237–269, 1983.
Leo Bachmair and Nachum Dershowitz. Commutation, transformation, and termination. In Proceedings of the Eighth International Conference on Automated Deduction, Oxford, England, volume 230 of Lecture Notes in Computer Science, pages 5–20. Springer, 1986.
Francois Bellegarde. Program transformation and rewriting. In R. Book, editor, Proceedings of the Fourth International Conference on Rewriting Techniques and Applications, Como, Italy, April 1991, volume 488 of Lecture Notes in Computer Science, pages 226–239. Springer, Berlin, 1991.
J. A. Bergstra and J. V. Tucker. A characterization of computable data types by means of a finite equational specification method. In J. W. de Bakker and J. van Leeuwen, editors, Proceedings of the Seventh International Colloquium on Automata, Languages and Programming, volume 85 of Lecture Notes in Computer Science, pages 76–90. Springer, Amsterdam, 1980.
A. Church. The calculi of lambda conversion. In Annals of Mathematics Studies, volume 6. Princeton University Press, 1941.
M. Dauchet. Simulation of Turing machines by a left-linear rewrite rule. In N. Dershowitz, editor, Proceedings of the Third International Conference on Rewriting Techniques and Applications, Chapel Hill, NC, April 1989, volume 355 of Lecture Notes in Computer Science, pages 109–120. Springer, Berlin, 1989.
Nachum Dershowitz. Applications of the Knuth-Bendix completion procedure. In Proc. of the Seminaire d'Informatique Theorique, Paris, December 1982, pages 95–111, 1982.
Nachum Dershowitz. Synthesis by Completion. In Proc. 9th Intern. Joint Conference on Artificial Intelligence, Los Angeles, pages 208–214, 1985.
Nachum Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3(1&2):69–115, 1987.
Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Formal Models and Semantics. Handbook of Theoretical Computer Science, volume B, pages 243–320. North-Holland, Amsterdam, 1990.
Nachum Dershowitz and Eli Pinchover. Inductive synthesis of equational programs. In AAAI-90, Proceedings, Eighth National Conference on Artificial Intelligence, pages 234–239. MIT Press, 1990.
Nachum Dershowitz and Uday S. Reddy. Deductive and Inductive Synthesis of Equational Programs. Journal of Symbolic Computation, 15(5&6):467–494, 1993.
E Mark Gold. Language identification in the limit. Information and Control, 14:447–474, 1967.
Ulf Goldammer. A method for the inductive synthesis of rewrite programs based on Knuth-bendix-completion techniques. GOSLER Report 06/92, Technische Hochschule Leipzig, FB Mathematik & Informatik, February 1992.
Gunter Grieser. TLPS — a term rewriting laboratory (not only) for experiments in automatic program synthesis. GOSLER Report 22/93, HTWK Leipzig (FH), FB Informatik, Mathematik & Naturwissenschaften, December 1993.
J.W. Klop. Term Rewriting Systems. In S. Abramsky, Dov. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of logic in computer science, volume 1, pages 1–116. Oxford University Press, New York, 1992.
Steffen Lange. Towards a Set of Inference Rules for Solving Divergence in Knuth-Bendix completion. In Klaus P. Jantke, editor, Analogical and Inductive Inference, AII'89, volume 397 of Lecture Notes in Artificial Intelligence, pages 304–316. Springer-Verlag, 1989.
Aart Middeldorp and Yoshihito Toyama. Completeness of Combinations of Constructor Systems. In R. Book, editor, Proceedings of the Fourth International Conference on Rewriting Techniques and Applications, Como, Italy, April 1991, volume 488 of Lecture Notes in Computer Science, pages 188–199. Springer, Berlin, 1991.
Michael Machtey and Paul Young. An Introduction to the General Theory of Algorithms. North-Holland, 1974.
M. J. O'Donnell. Computing in Systems Described by Equations, volume 58 of Lecture Notes in Computer Science. Springer, 1977.
Uday S. Reddy. Rewriting Techniques for Program Synthesis. In N. Dershowitz, editor, Proceedings of the Third International Conference on Rewriting Techniques and Applications, Chapel Hill, NC, April 1989, volume 355 of Lecture Notes in Computer Science, pages 338–403. Springer, Berlin, 1989.
Muffy Thomas and Klaus P. Jantke. Inductive inference for solving divergence in Knuth-Bendix completion. In K.P. Jantke, editor, Analogical and Inductive Inference, Lecture Notes in Artificial Intelligence 397, pages 288–303. Springer-Verlag, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Goldammer, U. (1995). Inductive synthesis of rewrite programs. 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_21
Download citation
DOI: https://doi.org/10.1007/3-540-60217-8_21
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