Advertisement

Or-Parallelism within Tabling

  • Ricardo Rocha
  • Fernando Silva
  • Vítor Santos Costa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1551)

Abstract

One important advantage of logic programming is that it allows the implicit exploitation of parallelism. Towards this goal, we suggest that or-parallelism can be efficiently exploited in tabling systems and propose two alternative approaches, Or-Parallelism within Tabling (OPT) and Tabling within Or-Parallelism (TOP). We concentrate on the fundamental concepts of an environment copying based model to implement the OPT approach and introduce the data structures and algorithms necessary to extend the YapOr Or-Parallel system, in order to obtain a parallel tabling system.

Keywords

Parallel Logic Programming Or-Parallelism Tabling 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    K. A. M. Ali and R. Karlsson. Full Prolog and Scheduling OR-Parallelism in Muse. Intern. Journal of Parallel Programming, 19(6), Dec. 1990.Google Scholar
  2. [2]
    K. A. M. Ali and R. Karlsson. Scheduling Speculative Work in Muse and Performance Results. Intern. Journal of Parallel Programming, 21(6), Dec. 1992.Google Scholar
  3. [3]
    W. Chen and D.S. Warren. Query Evaluation under the Well Founded Semantics. In Proc. of PODS’93, pages 168–179, 1993.Google Scholar
  4. [4]
    B. Demoen and K. Sagonas. CAT: the Copying Approach to Tabling. In Proc. of PLILP/ALP’98. Springer-Verlag, Sep. 1998.Google Scholar
  5. [5]
    E. Lusk et. al. The Aurora Or-parallel Prolog System. In Proc. of FGCS’88, pages 819–830. ICOT, Nov. 1988.Google Scholar
  6. [6]
    J. Freire, R. Hu, T. Swift, and D. S. Warren. Exploiting Parallelism in Tabled Evaluations. In Proc. of PLILP’95, pages 115–132. Springer-Verlag, 1995.Google Scholar
  7. [7]
    J. Freire, T. Swift, and D. S. Warren. Beyond Depth-First: Improving Tabled Logic Programs through Alternative Scheduling Strategies. In Proc. of PLILP’96, pages 243–258. Springer-Verlag, Sep. 1996.Google Scholar
  8. [8]
    I. V. Ramakrishnan, P. Rao, K. Sagonas, T. Swift, and D. S. Warren. Efficient Tabling Mechanisms for Logic Programs. In Proc. of ICLP’95, pages 687–711. The MIT Press, June 1995.Google Scholar
  9. [9]
    R. Rocha, F. Silva, and V. S. Costa. YapOr: an Or-Parallel Prolog System based on Environment Copying. Technical Report DCC-97-14, DCC-FC & LIACC, University of Porto, Dec. 1997.Google Scholar
  10. [10]
    K. Sagonas and T. Swift. An Abstract Machine for Tabled Execution of Fixed-Order Stratified Logic Programs. Journal of ACM Transactions on Programming Languages and Systems, 1998. To appear.Google Scholar
  11. [11]
    K. Sagonas, T. Swift, and D. S. Warren. XSB as an Efficient Deductive Database Engine. In Proc. of ACM SIGMOD International Conference on the Management of Data, pages 442–453, May 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Ricardo Rocha
    • 1
  • Fernando Silva
    • 1
  • Vítor Santos Costa
    • 1
  1. 1.DCC-FC & LIACCUniversity of PortoPortoPortugal

Personalised recommendations