Skip to main content
SpringerLink
Log in

The Declarative Side of Magic

  • Chapter
  • First Online:
Book cover Computational Logic: Logic Programming and Beyond

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2408))

Abstract

In this paper, we combine a novel method for proving partial correctness of logic programs with a known method for proving termination, and apply them to the study of the magic-sets transformation. As a result, a declarative reconstruction of efficient bottom-up execution of goal-driven deduction is accomplished, in the sense that the obtained results of partial and total correctness of the transformation abstract away from procedural semantics.

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 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.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. K.R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 493–574. Elsevier, 1990.

    Google Scholar 

  2. K. R. Apt. Declarative programming in Prolog. In D. Miller, editor, Proc. International Symposium on Logic Programming, pages 11–35. MIT Press, 1993.

    Google Scholar 

  3. K.R. Apt. Program Verification and Prolog. In E. Börger, editor, Specification and Validation methods for Programming languages and systems. Oxford University Press, 1994.

    Google Scholar 

  4. K.R. Apt, M. Gabbrielli, and D. Pedreschi. A Closer Look at Declarative Interpretations. Technical Report CS-R9470, Centre for Mathematics and Computer Science, Amsterdam, Journal of Logic Programming. 28(2): 147–180, 1996.

    Google Scholar 

  5. K.R. Apt and E. Marchiori. Reasoning about Prolog programs: from modes through types to assertions. Formal Aspects of Computing, 6A:743–764, 1994.

    Article  Google Scholar 

  6. K.R. Apt and D. Pedreschi. Reasoning about termination of pure prolog programs. Information and computation, 106(1):109–157, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  7. K. R. Apt and D. Pedreschi. Modular termination proofs for logic and pure Prolog programs. In G. Levi, editor, Advances in Logic Programming Theory, pages 183–229. Oxford University Press, 1994.

    Google Scholar 

  8. A. Bossi and N. Cocco. Verifying Correctness of Logic Programs. In J. Diaz and F. Orejas, editors, TAPSOFT’ 89, volume 352 of Lecture Notes in Computer Science, pages 96–110. Springer-Verlag, Berlin, 1989.

    Google Scholar 

  9. C. Beeri and R. Ramakrishnan. The power of magic. In Proc. 6th ACM-SIGMOD-SIGACT Symposium on Principles of Database systems, pages 269–283. The Association for Computing Machinery, New York, 1987.

    Google Scholar 

  10. F. Bronsard, T.K. Lakshman, and U.S. Reddy. A framework of directionality for proving termination of logic programs. In K. R. Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 321–335. MIT Press, 1992.

    Google Scholar 

  11. P. Deransart. Proof methods of declarative properties of definite programs. Theoretical Computer Science, 118:99–166, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  12. J.W. Lloyd. Foundations of logic programming. Springer-Verlag, Berlin, second edition, 1987.

    MATH  Google Scholar 

  13. P. Mascellani. Declarative Verification of General Logic Programs. In Proceedings of the Student Session, ESSLLI-2000. Birmingham UK, 2000.

    Google Scholar 

  14. P. Mascellani and D. Pedreschi. Proving termination of prolog programs. In Proceedings 1994 Joint Conf. on Declarative Programming GULP-PRODE’ 94, pages 46–61, 1994.

    Google Scholar 

  15. P. Mascellani and D. Pedreschi. Total correctness of prolog programs. In F.S. de Boer and M. Gabbrielli, editors, Proceedings of the W2 Post-Conference Workshop ICLP’94. Vrije Universiteit Amsterdam, 1994.

    Google Scholar 

  16. D. Pedreschi. Verification of Logic Programs. In M. I. Sessa, editor, Ten Years of Logic Programming in Italy, pages 211–239. Palladio, 1995.

    Google Scholar 

  17. D. Pedreschi and S. Ruggieri. Verification of Logic Programs. Journal of Logic Programming, 39(1–3):125–176, April 1999

    Google Scholar 

  18. S. Ruggieri. Proving (total) correctness of prolog programs. In F.S. de Boer and M. Gabbrielli, editors, Proceedings of the W2 Post-Conference Workshop ICLP’94. Vrije Universiteit Amsterdam, 1994.

    Google Scholar 

  19. J.D. Ullman. Principles of Database and Knowledge-base Systems, Volume I. Principles of Computer Science Series. Computer Science Press, 1988.

    Google Scholar 

  20. J.D. Ullman. Principles of Database and Knowledge-base Systems, Volume II; The New Technologies. Principles of Computer Science Series. Computer Science Press, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica, Università di Siena, via del Capitano 15, Siena, Italy

    Paolo Mascellani

  2. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, Pisa, Italy

    Dino Pedreschi

Authors
  1. Paolo Mascellani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dino Pedreschi
    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 Cyprus, 75 Kallipoleos St., 1678, Nicosia, Cyprus

    Antonis C. Kakas

  2. Department of Computing, Imperial College of Science, Technology and Medicine, 180 Queen’s Gate, London, SW7 2BZ, UK

    Fariba Sadri

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Mascellani, P., Pedreschi, D. (2002). The Declarative Side of Magic. In: Kakas, A.C., Sadri, F. (eds) Computational Logic: Logic Programming and Beyond. Lecture Notes in Computer Science(), vol 2408. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45632-5_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-45632-5_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43960-8

  • Online ISBN: 978-3-540-45632-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation