Skip to main content
SpringerLink
Log in

Termination Analysis for Tabled Logic Programming

  • Conference paper
  • First Online:
Logic Program Synthesis and Transformation (LOPSTR 1997)

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

Abstract

We provide a theoretical basis for studying the termination of tabled logic programs executed under SLG-resolution using a left-to-right computation rule. To this end, we study the classes of quasi-terminating and LG-terminating programs (for a set of atomic goals S). These are tabled logic programs where execution of each call from S leads to only a finite number of different (i.e., non-variant) calls, and a finite number of different calls and computed answer substitutions for them, respectively. We then relate these two classes through a program transformation, and present a characterisation of quasi-termination by means of the notion of quasi-acceptability of tabled programs. The latter provides us with a practical method of proving termination and the method is illustrated on non-trivial examples of tabled logic programs.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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 and D. Pedreschi. Reasoning about Termination of Pure Prolog Programs. Information and Computation, 106(1):109–157, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  2. R. Bol and L. Degerstedt. The Underlying Search for Magic Templates and Tabulation. In D. S. Warren, editor, Proceedings of the Tenth International Conference on Logic Programming, pages 793–811, Budapest, Hungary, June 1993. The MIT Press.

    Google Scholar 

  3. A. Bossi, N. Cocco, and M. Fabris. Norms on Terms and their use in Proving Universal Termination of a Logic Program. Theoretical Computer Science, 124(2):297–328, February 1994.

    Article  MATH  MathSciNet  Google Scholar 

  4. W. Chen and D. S. Warren. Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM, 43(1):20–74, January 1996.

    Article  MATH  MathSciNet  Google Scholar 

  5. D. De Schreye, S. Decorte. Termination of Logic Programs: The never-ending story. Journal of Logic Programming, 19/20:199–260, May/July 1994.

    Article  Google Scholar 

  6. D. De Schreye, K. Verschaetse, and M. Bruynooghe. A Framework for Analysing the Termination of Definite Logic Programs with respect to Call Patterns. In Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS’92), pages 481–488, ICOT Tokyo, 1992. ICOT.

    Google Scholar 

  7. M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative Modeling of the Operational Behaviour of Logic Languages. Theoretical Computer Science, 69(3):289–318, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  8. A. J. Glenstrup and N. D. Jones. BTA algorithms to ensure Termination of off-line Partial Evaluation. In Perspectives of System Informatics: Proceedings of the Andrei Ershov Second International Memorial Conference, LNCS, pages 25–28. Springer-Verlag, June 1996.

    Google Scholar 

  9. C. K. Holst. Finiteness Analysis. In J. Hughes, editor, Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture (FPCA), number 523 in LNCS, pages 473–495. Springer-Verlag, August 1991.

    Google Scholar 

  10. J. Jørgensen and M. Leuschel. Effciently Generating Effcient Generating Extensions in Prolog. In O. Danvy, R. Glück, and P. Thiemann, editors, Proceedings of the 1996 Dagstuhl Seminar on Partial Evaluation, number 1110 in LNCS, pages 238–262, Schloß Dagstuhl, 1996. Springer-Verlag.

    Google Scholar 

  11. T. Kanamori and T. Kawamura. OLDT-based Abstract Interpretation. Journal of Logic Programming, 15(1&2):1–30, January 1993.

    Article  MATH  MathSciNet  Google Scholar 

  12. M. Leuschel, B. Martens, and K. Sagonas. Preserving Termination of Tabled Logic Programs While Unfolding. In N. Fuchs, editor, Proceedings of Logic Program Synthesis and Transformation (LOPSTR’97), Leuven, Belgium, July 1997.

    Google Scholar 

  13. T. Mogensen and A. Bondorf. Logimix: A self-applicable Partial Evaluator for Prolog. In K.-K. Lau and T. Clement, editors, Proceedings of Logic Program Synthesis and Transformation (LOPSTR’92), pages 214–227. Springer-Verlag, 1992.

    Google Scholar 

  14. L. Plümer. Termination Proofs for Logic Programs, number 446 in LNCS. Springer-Verlag, 1990.

    MATH  Google Scholar 

  15. K. Sagonas, T. Swift, and D. S. Warren. XSB as an Effcient Deductive Database Engine. In Proceedings of the ACM SIGMOD International Conference on the Management of Data, pages 442–453, Minneapolis, Minnesota, May 1994. ACM Press.

    Google Scholar 

  16. 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, London, July 1986. Springer-Verlag.

    Google Scholar 

  17. L. Vieille. Recursive Query Processing: The Power of Logic. Theoretical Computer Science, 69(1):1–53, 1989.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, B-3001, Heverlee, Belgium

    Stefaan Decorte, Danny De Schreye, Michael Leuschel, Bern Martens & Konstantinos Sagonas

Authors
  1. Stefaan Decorte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Danny De Schreye
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael Leuschel
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bern Martens
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Konstantinos Sagonas
    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 Zurich, CH-8057, Zurich, Switzerland

    Norbert E. Fuchs

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Decorte, S., De Schreye, D., Leuschel, M., Martens, B., Sagonas, K. (1998). Termination Analysis for Tabled Logic Programming. In: Fuchs, N.E. (eds) Logic Program Synthesis and Transformation. LOPSTR 1997. Lecture Notes in Computer Science, vol 1463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49674-2_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-49674-2_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49674-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation