Skip to main content
SpringerLink
Log in

Independence in dynamically scheduled logic languages

  • Logic Programming
  • Conference paper
  • First Online:
Algebraic and Logic Programming (ALP 1996)

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

Included in the following conference series:

  • 144 Accesses

Abstract

The notion of independence has been used in conventional logic programming as the basis for several optimizations, including program parallelization, intelligent backtracking, and goal reordering. In this paper we extend this notion to logic programming languages with dynamic scheduling. This type of scheduling, in which some calls are dynamically “delayed” until their arguments are sufficiently instantiated, is provided in most practical implementations because it offers advantages for both programming power and declarativeness. We focus on the notion of independence required for ensuring correctness and efficiency of parallelization within the independent and-parallel model. We also provide sufficient conditions for independence which can be evaluated “a-priori” (i.e., at run-time), as is needed in many practical applications.

This work was funded in part by ESPRIT project 7195 (ACCLAIM) and by CICYT project TIC93-0975CE, and by a grant from the Australian Research Council.

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. S. K. Debray. QD-Janus: A Sequential Implementation of Janus in Prolog. Software—Practice and Experience, 23(12):1337–1360, December 1993.

    Google Scholar 

  2. M. Hermenegildo et al. Some Methodological Issues in the Design of CIAO — A Generic, Parallel, Concurrent Constraint System. In Principles and Practice of Constraint Programming, LNCS 874, pages 123–133. Springer-Verlag, May 1994.

    Google Scholar 

  3. M. García de la Banda, F. Bueno, and M. Hermenegildo. Towards independent And-Parallelism in CLP. In International Symposium on Programming Language Implementation and Logic Programming, PLILP'96, LNCS. Springer Verlag, September 1996.

    Google Scholar 

  4. M. García de la Banda, M. Hermenegildo, and K. Marriott. Independence in Constraint Logic Programs. In 1993 International Logic Programming Symposium, pages 130–146. MIT Press, Cambridge, MA, October 1993.

    Google Scholar 

  5. M. García de la Banda, K. Marriott, and P. Stuckey. Efficient Analysis of Constraint Logic Programs with Dynamic Scheduling. In 1995 International Logic Programming Symposium, Portland, Oregon, December 1995. MIT Press, Cambridge, MA.

    Google Scholar 

  6. S. Haridi and S. Janson. Kernel Andorra Prolog and its Computation Model. In Proceedings of the Seventh International Conference on Logic Programming, pages 31–46. MIT Press, June 1990.

    Google Scholar 

  7. M. Hermenegildo and F. Rossi. Strict and Non-Strict Independent And-Parallelism in Logic Programs: Correctness, Efficiency, and Compile-Time Conditions. Journal of Logic Programming, 22(1):1–45, 1995.

    Google Scholar 

  8. J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In ACM Symp. Principles of Programming Languages, pages 111–119. ACM, 1987.

    Google Scholar 

  9. K. Marriott, M. García de la Banda, and M. Hermenegildo. Analyzing Logic Programs with Dynamic Scheduling. In 20th. Annual ACM Conf. on Principles of Programming Languages, pages 240–254. ACM, January 1994.

    Google Scholar 

  10. L. M. Pereira and A. Porto. Selective backtracking. In Logic Programming, pages 107–114. Academic Press, 1982.

    Google Scholar 

  11. V. Saraswat. Compiling CP() on top of Prolog. Technical Report CMU-CS-87-174, Computer Science Department, Carnegie-Mellon University, Pittsburgh, October 1987.

    Google Scholar 

  12. K. Ueda and T. Chikiyama. A compiler for concurrent prolog. In Second International Symposium on Logic Programming, pages 119–126, Boston, July (1985). IEEE Press.

    Google Scholar 

  13. D.H.D. Warren and F. C. N. Pereira. An Efficient, Easily Adaptable System For Interpreting Natural Language Queries. American Journal of Computational Linguistics, 8(3–4):110–122, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Monash University, 3168, Clayton, VIC, Australia

    María García de la Banda & Kim Marriott

  2. Universidad Politécnica de Madrid, 28660, Boadilla del Monte, Spain

    Manuel Hermenegildo

Authors
  1. María García de la Banda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manuel Hermenegildo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kim Marriott
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael Hanus Mario Rodríguez-Artalejo

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de la Banda, M.G., Hermenegildo, M., Marriott, K. (1996). Independence in dynamically scheduled logic languages. In: Hanus, M., Rodríguez-Artalejo, M. (eds) Algebraic and Logic Programming. ALP 1996. Lecture Notes in Computer Science, vol 1139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61735-3_3

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-70672-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation