Polytool: polynomial interpretations as a basis for termination analysis of logic programs

DOI10.1017/S1471068410000025MaRDI QIDQ3087808zbMATH OpenFDO

Authors Manh Thang Nguyen, Danny De Schreye, Jürgen Giesl, Peter Schneider-Kamp

Publication date 17 August 2011

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S1471068410000025

zbMATH Keywords

acceptabilitypolynomial interpretationstermination analysis

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Logic Programming
• Automated Termination Analysis for Logic Programs by Term Rewriting
• SAT Solving for Termination Analysis with Polynomial Interpretations
• A general framework for automatic termination analysis od logic programs
• scientific article; zbMATH DE number 1088021

Cited in

(9)

• Constraint-based correctness proofs for logic program transformations
• Analyzing program termination and complexity automatically with \textsf{AProVE}
• Dependency triples for improving termination analysis of logic programs with cut
• Non-termination analysis of logic programs with integer arithmetics
• Maximal Termination
• scientific article; zbMATH DE number 1948414 (Why is no real title available?)
• Logic + control: on program construction and verification
• Correctness and completeness of logic programs
• Logic Programming

This page was built for publication: Polytool: polynomial interpretations as a basis for termination analysis of logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3087808)