Skip to main content
SpringerLink
Log in

Towards a Logic for Reasoning About Logic Programs Transformation

  • Conference paper
  • First Online:
Logic Program Synthesis and Transformation (LOPSTR 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1463))

  • 140 Accesses

Abstract

We give a proof-theoretic analysis of logic programs transformations, viewed as operations on proof trees in the sense of [3]

This work was mostly completed during a visit by the first author to the Dipartimento di Scienze dell’Informazione, Universita’ degli studi di Milano.

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

Access this chapter

Log in via an institution
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. Apt, K.A.: Logic Programming. In: Leuween J. (ed.): Handbook of Theoretical Computer Science. Elsevier (1990)

    Google Scholar 

  2. Danvy, O., Gluck, R., Thiemann, P., (eds.): Partial Evaluation. International Seminar. Dagstuhl Castle, Germany, February 12–16. Selected Papers. LNCS 1110. Springer Verlag (1996)

    Google Scholar 

  3. Hallnäs, L., Schroeder-Heister, P.: A Proof-theoretic Approach to Logic Programming: Clauses as Rules. Journal of Logic and Computation 1:2 (1990) 261–283

    Article  MATH  MathSciNet  Google Scholar 

  4. Hodges, W.: Logical Features of Horn Clauses. In: Gabbay, D.M., Hogger, C.J, Robinson, J.A., (eds.): Handbook of Logic in Artificial Intelligence and Logic Programming. Volume 1: Logical Foundations. Oxford University Press (1993) 449–503

    Google Scholar 

  5. Komorowski, J.: A Prolegomenon to Partial Deduction. Fundamenta Informaticae. Annales Societatis Mathematicae Polonae 8 (1993) 41–63

    MathSciNet  Google Scholar 

  6. Komorowski, J. (Guest Editor): Special Issue on Partial Deduction. Journal of Logic Programming 14 (1993)

    Google Scholar 

  7. Jones, N.D.: An Introduction to Partial Evaluation. Acm Computing Surveys 28:3 (1996) 480–531

    Article  Google Scholar 

  8. Lloyd, J.W., Shepherdson, J.: Partial Evaluation in Logic Programming. Journal of Logic Programming 11 (1991) 217–242

    Article  MATH  MathSciNet  Google Scholar 

  9. Momigliano, A., Ornaghi, M.: Regular Search Spaces as a Foundation of Logic Programming. In: Dyckhoff R. (ed.): Extensions of Logic Programming. LNAI 798. Springer Verlag (1994) 222–254

    Google Scholar 

  10. Momigliano, A., Ornaghi, M.: Regular Search Spaces and Constructive Negation. Journal of Logic and Computation 7:3 (1997) 367–403

    Article  MATH  MathSciNet  Google Scholar 

  11. Pettorossi, A., Proietti, M.: Transformation of Logic Programs: Foundations and Techniques. Journal of Logic Programming 19–20 (1994) 261–321

    Article  MathSciNet  Google Scholar 

  12. Prawitz, D.: Natural deduction. A Proof-Theoretical Study. Almquist Wiksell (1965)

    Google Scholar 

  13. Sahlin, D.: An Automatic Partial Evaluator for Full Prolog. Report TRITA-TCS 91:01 (1991)

    Google Scholar 

  14. Schroeder-Heister, P.: Rules of definitional reflection. In: Proceedings of the IEEE Symposium on Logic in Computer Science. (1993) 222–232

    Google Scholar 

  15. Seki, H.: Unfold/Fold Transformation of Stratified Programs. Theoretical Computer Science 86 (1991) 107–139

    Article  MATH  MathSciNet  Google Scholar 

  16. Sheperdson, J.C.: Unfold/Fold Transformations of Logic Programs. Math. Structure Comp. Science 2 (1992) 143–157

    Article  Google Scholar 

  17. Tamaki, H, Sato, T.: Unfold/Fold Transformation of Logic Programs. In: S-A Tärlund (Ed.): Proceedings of ICLP84. Uppsala. (1984) 127–138

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Philosophy, Carnegie Mellon University, 15213, Pittsburgh, PA, USA

    Alberto Momigliano

  2. Dipartimento di Scienze dell’Informazione, Universita’ degli studi di Milano, Via Comelico 39/41, Milano, Italy

    Mario Ornaghi

Authors
  1. Alberto Momigliano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mario Ornaghi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Zurich, CH-8057, Zurich, Switzerland

    Norbert E. Fuchs

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Momigliano, A., Ornaghi, M. (1998). Towards a Logic for Reasoning About Logic Programs Transformation. In: Fuchs, N.E. (eds) Logic Program Synthesis and Transformation. LOPSTR 1997. Lecture Notes in Computer Science, vol 1463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49674-2_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-49674-2_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65074-4

  • Online ISBN: 978-3-540-49674-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation