Skip to main content
SpringerLink
Log in

Termination of Logic Programs for Various Dynamic Selection Rules

  • Conference paper
Logic Programming (ICLP 2003)

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

Included in the following conference series:

Abstract

The standard selection rule in logic programming always selects the leftmost atom in each query. But for some applications this rule is not adequate, and dynamic scheduling, i.e. a mechanism to determine the selected atom at runtime, is needed. The complex (non-)termination behaviour related to dynamic scheduling has first been observed by Naish [3].

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 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.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. Bossi, A., Etalle, S., Rossi, S., Smaus, J.-G.: Semantics and termination of simply moded logic programs with dynamic scheduling. Transactions on Computational Logic (2003) (to appear), Available from http://www.dsi.unive.it/%7Esrossi/papers.html

  2. Marchiori, E., Teusink, F.: On termination of logic programs with delay declarations. Journal of Logic Programming 39(1-3), 95–124 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Naish, L.: Coroutining and the construction of terminating logic programs. Technical Report 92/5, Department of Computer Science, University of Melbourne (1992)

    Google Scholar 

  4. Smaus, J.-G.: Proving termination of input-consuming logic programs. In: De Schreye, D. (ed.) Proc. of the International Conference on Logic Programming, pp. 335–349. MIT Press, Cambridge (1999)

    Google Scholar 

  5. Smaus, J.-G.: Termination of logic programs for various dynamic selection rules. Technical Report 191, Insitut für Informatik, Universität Freiburg (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Freiburg, Georges-Köhler-Allee 52, 79110, Freiburg im Breisgau, Germany

    Jan-Georg Smaus

Authors
  1. Jan-Georg Smaus
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Ecole Polytechnique, Rue de Saclay, 91128, Palaiseau Cedex, France

    Catuscia Palamidessi

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Smaus, JG. (2003). Termination of Logic Programs for Various Dynamic Selection Rules. In: Palamidessi, C. (eds) Logic Programming. ICLP 2003. Lecture Notes in Computer Science, vol 2916. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24599-5_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24599-5_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20642-2

  • Online ISBN: 978-3-540-24599-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation