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.
Similar content being viewed by others
References
Y. Deville. Logic Programming: Systematic Program Development. Addison-Wesley, 1990.
P. Flener. Logic Program Synthesis from Incomplete Information. Kluwer, 1995.
P. Flener and Y. Deville. Logic Program Transformation through Generalization Schemata. TR BU-CEIS-95xx, Bilkent University, Ankara (Turkey), 1995.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flener, P., Deville, Y. (1996). Logic program transformation through generalization schemata [extended abstract]. In: Proietti, M. (eds) Logic Program Synthesis and Transformation. LOPSTR 1995. Lecture Notes in Computer Science, vol 1048. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60939-3_13
Download citation
DOI: https://doi.org/10.1007/3-540-60939-3_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60939-1
Online ISBN: 978-3-540-49745-5
eBook Packages: Springer Book Archive