Skip to main content

Pruning Operators for Partial Evaluation

  • Conference paper
Logic Program Synthesis and Transformation

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

  • 34 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Franzen. Formal aspects of Kernel Andorra: I. Technical Report ISSN 0283-3638, Swedish Institute of Computer Science, 1990.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. 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.

    Article  MathSciNet  MATH  Google Scholar 

  5. J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, second edition, 1987.

    Google Scholar 

  6. 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.

    Google Scholar 

  7. B. J. Ross. An Algebraic Semantics of Prolog Control. PhD thesis, Edinburgh University, 1991.

    Google Scholar 

  8. 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.

    Google Scholar 

  9. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics