Skip to main content
SpringerLink
Log in

Pruning the search space of logic programs

  • Conference paper
  • First Online:
Book cover Extensions of Logic Programming (ELP 1996)

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

Included in the following conference series:

Abstract

We analyse the use of pruning operators for reducing the search space of logic programming computations. The synthesis of a few key choices arising in the implementation of pruning operators allows us to compare alternative pruning strategies at a suitably abstract level. In this perspective, we examine the commit operator featured by the language Gödel.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Börger and E. Riccobene. Logic+Control revisited: An abstract interpreter for Gödel programs. In G. Levi, editor, Advances in Logic Programming Theory. Oxford Univ. Press, 1994.

    Google Scholar 

  2. A.F. Bowers and C.A. Gurr. Towards fast and declarative meta-programming. In Meta-programming in Logic Programming, pages 137–166. MIT Press, 1995.

    Google Scholar 

  3. A. Brogi and S. Contiero. Composing logic programs by meta-programming in Gödel. In Meta-programming in Logic Programming, 167–194. MIT Press, 1995.

    Google Scholar 

  4. P.M. Hill and J.W. Lloyd. The Gödel Programming Language. MIT Press, 1994.

    Google Scholar 

  5. P.M. Hill, J.W. Lloyd, and J.C. Shepherdson. Properties of pruning operator. Journal of Logic and Computation, 1(1):99–143, 1990.

    Google Scholar 

  6. R.A. Kowalski. Predicate logic as a programming language. In IFIP 74, pages 569–574, 1974.

    Google Scholar 

  7. J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.

    Google Scholar 

  8. Lee Naish. Pruning in logic programming. Technical Report 95/16, Department of Computer Science, University of Melbourne, Melbourne, Australia, June 1995.

    Google Scholar 

  9. Lee Naish. Proving properties of committed choice logic programs. Journal of Logic Programming, 7(1):63–84, July 1989.

    Google Scholar 

  10. V.A. Saraswat. Concurrent Constraint Programming Languages. MIT Press, 1993.

    Google Scholar 

  11. E. Shapiro. The family of concurrent logic languages. ACM Computer Surveys, 21(3):412–510, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Antonio Brogi & Cosimo Guarino

Authors
  1. Antonio Brogi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cosimo Guarino
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Roy Dyckhoff Heinrich Herre Peter Schroeder-Heister

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag

About this paper

Cite this paper

Brogi, A., Guarino, C. (1996). Pruning the search space of logic programs. In: Dyckhoff, R., Herre, H., Schroeder-Heister, P. (eds) Extensions of Logic Programming. ELP 1996. Lecture Notes in Computer Science, vol 1050. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60983-0_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-60983-0_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49751-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation