Logic program transformation through generalization schemata [extended abstract]
Both generalization techniques are very suitable for mechanical transformation: all operators of the generalized programs are operators of the initial programs. Given a divide-and-conquer program, a mere inspection of the properties of its solving, processing, and composition operators thus allows the detection of which kinds of generalization are possible, and to which optimizations they would lead. The eureka discoveries are compiled away, and the transformations can be completely automated.
KeywordsLogic Program Composition Operator Program Transformation Generalization Schema Structural Generalization
Unable to display preview. Download preview PDF.
- Y. Deville. Logic Programming: Systematic Program Development. Addison-Wesley, 1990.Google Scholar
- P. Flener. Logic Program Synthesis from Incomplete Information. Kluwer, 1995.Google Scholar
- P. Flener and Y. Deville. Logic Program Transformation through Generalization Schemata. TR BU-CEIS-95xx, Bilkent University, Ankara (Turkey), 1995.Google Scholar
- N.E. Fuchs and M.P.J. Fromherz. Schema-based transformations of logic programs. In Clement and Lau (eds), Proc. of LOPSTR'91, pp. 111–125. Springer-Verlag, 1992.Google Scholar