Skip to main content
SpringerLink
Log in

Research Summary: Non-termination Analysis of Logic Programs

  • Conference paper
Logic Programming (ICLP 2009)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5649))

Included in the following conference series:

  • 743 Accesses

Abstract

An important advantage of Logic Programming (LP) is that a declarative programming style leads to more understandable and less error-prone computations. However, a declarative programming style also leads to less efficient, and in the extreme case, in non-terminating computations. Therefore, an important aspect of proving correctness of a program, is the analysis of the termination behavior of the program for a class of queries.

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

References

  1. Bruynooghe, M.: A practical framework for the abstract interpretation of logic programs. J. Log. Program. 10(1/2/3&4), 91–124 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  2. Nguyen, M.T., Giesl, J., Schneider-Kamp, P., De Schreye, D.: Termination analysis of logic programs based on dependency graphs, pp. 8–22 (2008)

    Google Scholar 

  3. Payet, É., Mesnard, F.: Nontermination inference of logic programs. ACM Transactions on Programming Languages and Systems 28(2), 256–289 (2006)

    Article  Google Scholar 

  4. De Schreye, D., Decorte, S.: Termination of logic programs: The neverending story. J. Log. Program. 19(20), 199–260 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  5. Shen, Y.-D., De Schreye, D., Voets, D.: Termination prediction for general logic programs: Submitted. Report CW 536 (2009) (Accepted for TPLP)

    Google Scholar 

  6. Voets, D., De Schreye, D.: A new approach to non-termination analysis of logic programs. Report CW 536 (2009) (Accepted for ICLP 2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, K.U. Leuven, Belgium

    Dean Voets

Authors
  1. Dean Voets
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing, University of Leeds, LS2 9JT, Leeds, UK

    Patricia M. Hill

  2. Deptartment of Computer Science, Stony Brook University, 11794-4400, Stony Brook, NY, USA

    David S. Warren

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Voets, D. (2009). Research Summary: Non-termination Analysis of Logic Programs. In: Hill, P.M., Warren, D.S. (eds) Logic Programming. ICLP 2009. Lecture Notes in Computer Science, vol 5649. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02846-5_60

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02846-5_60

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02845-8

  • Online ISBN: 978-3-642-02846-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation