Knuth-Bendix Completion Versus Fold/Unfold: A Comparative Study in Program Synthesis
作者： Bertram Fronhöfer , Ulrich Furbach
DOI: 10.1007/978-3-642-71385-9_29
关键词:
摘要: This paper is a comparative study in program synthesis. Two approaches — synthesis by means of the Knuth-Bendix completion procedure (KBCP) and classical transformation system based on unfold/fold technique are examined. A farreaching conformity detected two systems while other hand disparities derivations reveal greater rigidity KBCP employment equations as well certain indifference towards declarative contents definitions.
springer.com
sci-hub.st 参考文章(7)
Nachum Dershowitz, Synthesis by completion international joint conference on artificial intelligence. pp. 208- 214 ,(1985)
B. Fronhöfer, R. Caferra, P. Jacquet, Improvement of Recursive Programs from a Logic Programming Point of View GWAI. pp. 229- 237 ,(1985) , 10.1007/978-3-642-46546-8_18
David Harel, And/Or Programs: A New Approach to Structured Programming ACM Transactions on Programming Languages and Systems. ,vol. 2, pp. 1- 17 ,(1980) , 10.1145/357084.357085
D. E. Knuth, P. B. Bendix, Simple Word Problems in Universal Algebras Computational Problems in Abstract Algebra#R##N#Proceedings of a Conference Held at Oxford Under the Auspices of the Science Research Council Atlas Computer Laboratory, 29th August to 2nd September 1967. pp. 342- 376 ,(1983) , 10.1007/978-3-642-81955-1_23
Zohar Manna, Richard Waldinger, A Deductive Approach to Program Synthesis ACM Transactions on Programming Languages and Systems. ,vol. 2, pp. 90- 121 ,(1980) , 10.1145/357084.357090
R. M. Burstall, John Darlington, A Transformation System for Developing Recursive Programs Journal of the ACM. ,vol. 24, pp. 44- 67 ,(1977) , 10.1145/321992.321996
C. J. Hogger, Derivation of Logic Programs Journal of the ACM. ,vol. 28, pp. 372- 392 ,(1981) , 10.1145/322248.322258