Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T10:46:19.754Z Has data issue: false hasContentIssue false

Inference of termination conditions for numerical loops in Prolog

Published online by Cambridge University Press:  12 August 2004

ALEXANDER SEREBRENIK
Affiliation:
Department of Computer Science, K.U. Leuven, Celestijnenlaan 200A, B-3001, Heverlee, Belgium (e-mail: Alexander.Serebrenik@cs.kuleuven.ac.be, Danny.DeSchreye@cs.kuleuven.ac.be)
DANNY DE SCHREYE
Affiliation:
Department of Computer Science, K.U. Leuven, Celestijnenlaan 200A, B-3001, Heverlee, Belgium (e-mail: Alexander.Serebrenik@cs.kuleuven.ac.be, Danny.DeSchreye@cs.kuleuven.ac.be)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We present a new approach to termination analysis of numerical computations in logic programs. Traditional approaches fail to analyse them due to non well-foundedness of the integers. We present a technique that allows overcoming these difficulties. Our approach is based on transforming a program in a way that allows integrating and extending techniques originally developed for analysis of numerical computations in the framework of query-mapping pairs with the well-known framework of acceptability. Such an integration not only contributes to the understanding of termination behaviour of numerical computations, but also allows us to perform a correct analysis of such computations automatically, by extending previous work on a constraint-based approach to termination. Finally, we discuss possible extensions of the technique, including incorporating general term orderings.

Information

Type
Regular Papers
Copyright
© 2004 Cambridge University Press