Abstract
The design of program transformations is a difficult and error-prone task. We propose a practical approach to help programmers devise their program transformations: the programmer is to supply two versions of the same logic program, an inefficient one and another with a better computational performance, and the set of syntactic adjustments required to map them is automatically found. These adjustments are represented as transformations using an extended language based in program schemata and are subsequently made more generic, becoming applicable to a larger class of programs and thus extending the benefits of the transformation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Krzysztof, R.: Apt. From Logic Programming to Prolog. Prentice-Hall, U.K. (1997)
Chasseur, E., Deville, Y.: Logic program schemas, constraints, and semi-unification. In: Chasseur, E., Deville, Y. (eds.) LOPSTR 1997. LNCS, vol. 1463, p. 69. Springer, Heidelberg (1998)
Fuchs, N.E., Fromherz, M.P.J.: Schema-Based Transformations of Logic Programs. In: Proc. of LoPSTr 1991. Springer, Heidelberg (1992)
Gegg-Harrison, T.S.: Exploiting Program Schemata in a Prolog Tutoring System. Technical Report CS-1993-11, Department of Computer Science, Duke University; Durham, North Carolina, U.S.A., Reformatted version of PhD dissertation with the same title and equivalent content (April 1993)
Huet, G., Lang, B.: Proving and Applying Program Transformations Expressed with Second-Order Patterns. Acta Informatica 11, 31–55 (1978)
Büyükyildiz, H., Flener, P.: Generalised logic program transformation schemas. In: Fuchs, N.E. (ed.) LOPSTR 1997. LNCS, vol. 1463, p. 49. Springer, Heidelberg (1998)
Proietti, M., Pettorossi, A.: Transformations of Logic Programs: Foundations and Techniques. J. Logic Progr. 19, 20, 261–320 (1994)
Richardson, J.D.C., Fuchs, N.E.: Development of Correct Transformation Schemata for Prolog Programs. In: Fuchs, N.E. (ed.) LOPSTR 1997. LNCS, vol. 1463, p. 263. Springer, Heidelberg (1998)
Sterling, L., Shapiro, E.: The Art of Prolog. MIT Press, Cambridge (1986)
Tamaki, H., Sato, T.: Unfold/fold Transformations of Logic Programs. In: Proc. 2nd Int’l. Conf. on Logic Programming, Uppsala, Sweden (1984)
Vasconcelos, W.W.: Extracting, Organising, Designing and Reusing Prolog Programming Techniques. PhD thesis, Department of Artificial Intelligence, University of Edinburgh (August 1995)
Vasconcelos, W.W., Aragão, M.A., Fuchs, N.E.: Automatic Bottom-Up Analysis and Transformation of Logic Programs. In: Borges, D.L., Kaestner, C.A.A. (eds.) SBIA 1996. LNCS (LNAI), vol. 1159. Springer, Heidelberg (1996)
Vasconcelos, W.W., Fuchs, N.E.: An Opportunistic Approach for Logic Program Analysis and Optimisation using Enhanced Schema-Based Transformations. In: Proietti, M. (ed.) LOPSTR 1995. LNCS, vol. 1048. Springer, Heidelberg (1996)
Vasconcelos, W.W., Meneses, E.: A Pratical Approach for Logic Program Analysis and Transformation. In: Cairó, O., Cantú, F.J. (eds.) MICAI 2000. LNCS, vol. 1793. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weber-Vasconcelos, W., Aragão, M.A.T. (2000). Automatic Extraction of Logic Program Transformations from Examples. In: Cairó, O., Sucar, L.E., Cantu, F.J. (eds) MICAI 2000: Advances in Artificial Intelligence. MICAI 2000. Lecture Notes in Computer Science(), vol 1793. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10720076_21
Download citation
DOI: https://doi.org/10.1007/10720076_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67354-5
Online ISBN: 978-3-540-45562-2
eBook Packages: Springer Book Archive