Abstract
This paper is a comparative study in program synthesis. Two approaches — program synthesis by means of the Knuth-Bendix completion procedure (KBCP) and a classical transformation system based on the unfold/fold technique — are examined. A farreaching conformity is detected in the two systems while on the other hand disparities in the derivations reveal a greater rigidity of KBCP in the employment of the equations as well as a certain indifference towards the declarative contents of definitions.
This research was funded by ESPRIT P363 (ALPES) and the DFG
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bauer, F.L., Partsch, H., Pepper, P., Wössner, H.: Notes on the project CIP: Outline of a transformation system, TUM-INFO-7729, 1977.
Burstall, R., Darlington, J.: A transformation system for developing recursive programs, JACM,Vol. 24 No 1, January 1977,pp. 44–67.
Dershowitz, N.: Equations as Programming Language, Conference on Information Technology, Jerusalem, Israel, May 1984.
Dershowitz, N.: Synthesis by completion, IJCAI-85, pp. 208–214.
B.Fronhoefer, R.Caferra, P.Jacquet: Improvement of recursive programs from a logic programming point of view, GWAI-84, Informatik-Fachberichte 103, pp. 229–237
Furbach, U.: Ueber Transformationsregeln fuer nicht deterministische rekursive Funktionsdefinitionen, Diss. Universität der Bundeswehr München, 1983.
Hogger, C.J.: Derivation of logic programs, JACM,Vol. 28,No. 2, April 1981, pp. 372–392.
Knuth, D. E., Bendix, P. B.: Simple word problems in universal algebra, Proc. of the Conf. on Computational Problems in Abstract Algebra 1967, (ed. by J. Leech ), Pergamon Press, Oxford 1970, 263–298.
Kodratoff, Y., Picard, M.: Completion de systeme de reecriture et synthese de programmes a partir de leur specification, Journee Bigre 1983.
Kott, L.: Des substitution dans les systemes d’equations algebriques sur le magma. Application aux transformations de programmes et a leur correction. These de doctorat d’etat, Paris V II, 1979.
Manna, Z., Waldinger, R.: A deductive approach to program synthesis, ACM Trans. on programming languages and systems 2, 1, 1980.
Perdrix, H.: Synthese de programmes a partir de leurs specifications, Rap. de rech. No 187, Univ. Paris-Sud, Lab. de Rech. en Inform.
Schmitz, L.: Observations made when synthesizing transitive closure algorithms. In: Tagungsber. 2/1979, Math. Forschungsinstitut Oberwolfach, Formale Methoden und math. Hilfsmittel für die Softwarekonstruktion.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fronhöfer, B., Furbach, U. (1986). Knuth-Bendix Completion Versus Fold/Unfold: A Comparative Study in Program Synthesis. In: Rollinger, CR., Horn, W. (eds) GWAI-86 und 2. Österreichische Artificial-Intelligence-Tagung. Informatik-Fachberichte, vol 124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-71385-9_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-71385-9_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16808-9
Online ISBN: 978-3-642-71385-9
eBook Packages: Springer Book Archive