Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-25T04:48:56.069Z Has data issue: false hasContentIssue false
  • English
  • Français

Inference of termination conditions for numerical loops in Prolog

Published online by Cambridge University Press:  12 August 2004

ALEXANDER SEREBRENIK  and
DANNY DE SCHREYE
ALEXANDER SEREBRENIK
Affiliation:
Department of Computer Science, K.U. Leuven, Celestijnenlaan 200A, B-3001, Heverlee, Belgium (e-mail: [email protected], [email protected])
DANNY DE SCHREYE
Affiliation:
Department of Computer Science, K.U. Leuven, Celestijnenlaan 200A, B-3001, Heverlee, Belgium (e-mail: [email protected], [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Keywords

termination analysisnumerical computation
Type
Regular Papers
Information
Theory and Practice of Logic Programming , Volume 4 , Issue 5-6 , September 2004 , pp. 719 - 751
Copyright
© 2004 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)