Heuristics applied in tree manipulation algorithm synthesis
PROLOG program transformation is a hopeful method for derivation of algorithm. We apply this method to tree manipulation algorithm. In this case, besides Unfold/Fold transformation, some heuristic knowledge is necessary, for example avoiding re-execution of the same pattern of transformations. In this paper, we describe these heuristic knowledge in transformation. We also present B-tree insertion algorithm synthesis as a fair size example.
Unable to display preview. Download preview PDF.
- Darlington J. (1981) An Experimental Program Transformation and Synthesis System. Artificial Intelligence 16.Google Scholar
- Knuth D.E. (1981) The Art of Computer Programing, Vol 1. Addison-Wesley.Google Scholar
- Nakamura N., Nakagawa H. (1984) Transformation of Prolog Program with Heuristics. Proc. of the Logic Programming Conference '84.Google Scholar
- Sato T. (1984) Transformational Logic Program Synthesis. Proc. of FGCS '84.Google Scholar
- Sato T., Tamaki H. (1983) Transformation in Prolog. Proc. of Logic Programming Conference '83.Google Scholar
- Tamaki H., Sato T. (1984) Unfold/Fold Transformation of Logic Programs. Proc. of the 2nd International Logic Programming Conference.Google Scholar
- Tarlund S.A., Hasson A. (1982) Program Transformation by Data Structure Mapping. LOGIC PROGRAMMING. Academic-Press.Google Scholar