skip to main content
10.1145/1013963.1013975acmconferencesArticle/Chapter ViewAbstractPublication PagesppdpConference Proceedingsconference-collections
Article

Just enough tabling

Published:24 August 2004Publication History

ABSTRACT

We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled logic programs to be performed without resorting to any recomputation. We discuss issues that are involved in supporting pruning in tabled resolution, how re-execution of tabled computations which were previously pruned can be avoided, and we describe the implementation of such a scheme based on an abstract machine like CHAT, which implements the suspension/resumption support that tabling requires through a combination of freezing and copying of execution states of suspended computations. Properties of just enough tabling and possible uses of the JET mechanism in a tabling system are also briefly discussed.

References

  1. L. F. Castro, T. Swift, and D. S. Warren. Suspending and resuming computations in engines for SLG evaluation. In S. Krishnamurthi and C. R. Ramakrishnan, editors, Practical Applications of Declarative Languages: Proceedings of the PADL'2002 Symposium, number 2257 in LNCS, pages 332--350. Springer, Jan. 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. L. F. Castro and D. S. Warren. Approximate pruning in tabled logic programming. In P. Degano, editor, Programming Languages and Systems: Proceedings of the European Symposium on Programming, number 2618 in LNCS, pages 69--83. Springer, Apr. 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. J. ACM, 43(1):20--74, Jan. 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. B. Demoen and K. Sagonas. CHAT is θ (SLG-WAM). In H. Ganzinger, D. McAllester, and A. Voronkov, editors, LPAR'99: Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning, number 1705 in LNAI, pages 337--357. Springer, Sept. 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. B. Demoen and K. Sagonas. CHAT: the Copy-Hybrid Approach to Tabling. Future Generation Computer Systems, 16(7):809--830, May 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. H.-F. Guo and G. Gupta. A simple scheme for implementing tabled logic programming systems based on dynamic reordering of alternatives. In P. Codognet, editor, Proceedings of the 17th International Conference on Logic Programming, number 2237 in LNCS, pages 181--196. Springer, Nov./Dec. 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. H.-F. Guo and G. Gupta. Cuts in tabled logic programming. In B. Demoen, editor, Proceedings of CICLOPS'2002, the Colloquium on Implementation of Constraint and LOgic Programming Systems, pages 62--73, July 2002.]]Google ScholarGoogle Scholar
  8. I. V. Ramakrishnan, P. Rao, K. Sagonas, T. Swift, and D. S. Warren. Efficient access mechanisms for tabled logic programs. J. of Logic Program., 38(1):31--54, Jan. 1999.]]Google ScholarGoogle ScholarCross RefCross Ref
  9. R. Rocha, F. Silva, and V. Santos Costa. YapTab: A tabling engine designed to support parallelism. In Proceedings of Tabulation in Parsing and Deduction (TAPD), pages 77--87, Sept. 2000.]]Google ScholarGoogle Scholar
  10. K. Sagonas and T. Swift. An abstract machine for tabled execution of fixed-order stratified logic programs. ACM Trans. Prog. Lang. Syst., 20(3):586--634, May 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. K. Sagonas, T. Swift, and D. S. Warren. XSB as an efficient deductive database engine. In Proceedings of the ACM SIGMOD International Conference on the Management of Data, pages 442--453. ACM Press, May 1994.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of Mercury, an efficient purely declarative logic programming language. J. of Logic Program., 26(1-3):17--64, Oct./Dec. 1996.]]Google ScholarGoogle ScholarCross RefCross Ref
  13. H. Tamaki and T. Sato. OLD resolution with Tabulation. In E. Shapiro, editor, Proceedings of the Third International Conference on Logic Programming, number 225 in LNCS, pages 84--98. Springer-Verlag, July 1986.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. D. H. D. Warren. An abstract Prolog instruction set. Technical Report 309, SRI International, Menlo Park, U.S.A., Oct. 1983.]]Google ScholarGoogle Scholar
  15. N.-F. Zhou, Y.-D. Shen, L.-Y. Yuan, and J.-H. You. Implementation of a linear tabling mechanism. J. of Functional and Logic Program., 2001(10), 2001.]]Google ScholarGoogle Scholar

Index Terms

  1. Just enough tabling

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        PPDP '04: Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
        August 2004
        260 pages
        ISBN:1581138199
        DOI:10.1145/1013963

        Copyright © 2004 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 24 August 2004

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate230of486submissions,47%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader