Abstract
It is essential that any program transformation technique produces programs that, for given queries, can compute the same answers as the original programs. For logic programs, it has been shown that, under certain conditions, a partial evaluation of a program is computationally equivalent to the original program. Unfortunately, these results only apply to programs without control directives.
In this paper, we consider the difficulties of partially evaluating a logic program with a pruning operator such as the cut of Prolog and propose alternative pruning operators that overcome many of these problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. Franzen. Formal aspects of Kernel Andorra: I. Technical Report ISSN 0283-3638, Swedish Institute of Computer Science, 1990.
S. Haridi and P. Brand. Andorra Prolog: An integration of Prolog and committed choice languages. In Proceedings of the International Conference on Fifth Generation Computer Systems, Tokyo, pages 745-754, 1988.
P.M. Hill and J.W. Lloyd. The Gödel report (preliminary version). Technical Report CS-91-02, Department of Computer Science, University of Bristol, 1991.
P.M. Hill, J.W. Lloyd, and J.C. Shepherdson. Properties of a pruning operator. Journal of Logic and Computation, 1(1): 99–143, 1990.
J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, second edition, 1987.
J.W. Lloyd and J.C. Shepherdson. Partial evaluation in logic programming. Technical Report CS-87-09, Department of Computer Science, University of Bristol, 1987. Revised July 1989. To appear in The Journal of Logic Programming.
B. J. Ross. An Algebraic Semantics of Prolog Control. PhD thesis, Edinburgh University, 1991.
J. A. Thorn and J. Zobel. Nu-prolog reference manual, version 1.3. Technical Report TR 86/10, Machine Intelligence Project, Department of Computer Science, University of Melbourne, 1988.
D.H.D. Warren. The SRI model for or-parallel execution of Prolog — abstract design and implementation issues. In Proceedings of the 1987 Symposium on Logic Programming, San Francisco, pages 92-102. IEEE, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag London
About this paper
Cite this paper
Hill, P.M. (1992). Pruning Operators for Partial Evaluation. In: Clement, T.P., Lau, KK. (eds) Logic Program Synthesis and Transformation. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3494-7_14
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3494-7_14
Publisher Name: Springer, London
Print ISBN: 978-3-540-19742-3
Online ISBN: 978-1-4471-3494-7
eBook Packages: Springer Book Archive