Arrow Research search
Back to LOPSTR

LOPSTR 2006

Polytool: Proving Termination Automatically Based on Polynomial Interpretations

Conference Paper Termination and Analysis Formal Methods ยท Logic in Computer Science

Abstract

Abstract In this system description, we present Polytool, a fully automated system for proving left-termination of definite logic programs (LPs). The aim of Polytool is to extend the power of existing termination analysers by using well-founded orders based on polynomial interpretations. This is a direct extension of the well-founded orders based on (semi-)linear level mappings and norms that are used in most of the existing LP termination analysis systems.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
International Symposium on Logic-Based Program Synthesis and Transformation
Archive span
1990-2025
Indexed papers
560
Paper id
867668635184713532
v2026.09.13