Inference of termination conditions for numerical loops in Prolog
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
Cite
@article{arxiv.cs/0110034,
title = {Inference of termination conditions for numerical loops in Prolog},
author = {Alexander Serebrenik and Danny De Schreye},
journal= {arXiv preprint arXiv:cs/0110034},
year = {2007}
}
Comments
To appear in Theory and Practice of Logic Programming. To appear in Theory and Practice of Logic Programming