Abstract
This paper deals with the logic program transformation using the fold-unfold technique. The major problem in the strategies using fold-unfold transformation is to find a sequence of unfolding that permits the folding. In this paper we propose a technique that solves this problem for a particular class of logic programs. This technique consists in studying the possibility of folding for some simple or basic programs and then to apply these results for some more general logic programs. This technique permits to compute the sequence of unfolding to achieve a folding or to detect the impossibility of a folding, in the latter case the technique permits the invention of new predicates.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K.R. Apt and M.H Van Emden. Contribution to the Theory of Logic Programming. Journal of the Association for Computing Machinery, 29(3):841–862, 1982.
R.S. Boyer and J.S. Moore. A Computational Logic. Academic Press, New York, 1979.
M. Bruynooghe, L. De Raedt, and D. De Schreye. Explanation Based Program Transformation. In Proc. IJCAI Boston USA, 1989.
M. Bruynooghe, D. De Schreye, and B. Krekels. Compiling control. Journal of Logic Programming, 6(2 & 3):135–162, January 1989.
R.M Burstall and J.A Darlington. Transformation System for Developing Recursive Programs. Journal of the Association for Computing Machinery, 24(1):44–67, 1977.
J. Darlington. An Experimental Program Transformation and Synthesis System. Artificial Intelligence, 16:1–46, 1981.
S.K. Debray. Unfold/Fold Transformations and Loop Optimization of Logic Programs. In Proc. of the Sigplan'88 Conference on Programming Language Design and Implementation, pages 297–307, Atlanta, Georgia, June 1988.
M.S. Feather. A Survey and Classification of some Program Transformation Techniques. In Proc. TC2 IFIP Working Conference on Program Specification and Transformation, Bad-Tölz, F.R.G, 1986.
J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.
A. Pettorossi and M. Proietti. The Automatic Construction of Logic Programs. In IFIP WG2.1 Meeting, January 1989. Preliminary Version.
A. Pettorossi and M. Proietti. Decidability Results and Characterization of Strategies for the Development of Logic Programs. In G. Levi and M. Martelli, editors, 6th International Conference on Logic Programming, Lisbon (Portugal), 1989. MIT Press.
M. Proietti and A Pettorossi. The Synthesis of Eureka Predicates for Developing Logic Program. In N. Jones, editor, 3rd European Symposium on Programming, volume 432 of Lecture Notes in Computer Science, pages 306–325, Copenhaguen, 1990. Springer-Verlag.
H. Tamaki and T. Sato. Unfold/Fold Transformation of Logic Programs. In Proceedings of the 2nd International Logic Programming Conference, Uppsala, 1984.
B. Wegbreit. Goal-Directed Program Transformation. IEEE Transactions on Software Engineering, SE-2(2):69–80, 1976.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alexandre, F. (1992). A technique for transforming logic programs by fold-unfold transformations. In: Bruynooghe, M., Wirsing, M. (eds) Programming Language Implementation and Logic Programming. PLILP 1992. Lecture Notes in Computer Science, vol 631. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55844-6_137
Download citation
DOI: https://doi.org/10.1007/3-540-55844-6_137
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55844-6
Online ISBN: 978-3-540-47297-1
eBook Packages: Springer Book Archive