A general framework for automatic termination analysis od logic programs

DOI10.1007/S002000100065MaRDI QIDQ5941755zbMATH OpenOpenAlexFDO

Authors Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik

Publication date 26 August 2001

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002000100065

zbMATH Keywords

automatic termination analysis of logic programsTermiLog system

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 1497822
• The dependency triple framework for termination of logic programs
• Termination Analysis of Logic Programs Based on Dependency Graphs
• Termination proofs for logic programs
• Termination prediction for general logic programs

Cited in

(34)

• A complexity tradeoff in ranking-function termination proofs
• Termination proofs for logic programs
• Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems
• The size-change principle and dependency pairs for termination of term rewriting
• Automatic termination analysis for functional and imperative programs (Thesis, TU Darmstadt)
• scientific article; zbMATH DE number 1696776 (Why is no real title available?)
• Non-termination analysis of logic programs with integer arithmetics
• Polytool: polynomial interpretations as a basis for termination analysis of logic programs
• scientific article; zbMATH DE number 4176501 (Why is no real title available?)
• On termination of meta-programs
• The dependency triple framework for termination of logic programs
• Automated termination analysis for logic programs with cut
• Automated Termination Analysis for Logic Programs by Term Rewriting
• Termination prediction for general logic programs
• A methodology for proving termination of logic programs
• scientific article; zbMATH DE number 1088021 (Why is no real title available?)
• scientific article; zbMATH DE number 1948394 (Why is no real title available?)
• scientific article; zbMATH DE number 1973218 (Why is no real title available?)
• scientific article; zbMATH DE number 1497822 (Why is no real title available?)
• Automata-based termination proofs
• Inference of termination conditions for numerical loops in Prolog
• cTI: a constraint-based termination inference tool for ISO-Prolog
• A semantic basis for the termination analysis of logic programs
• scientific article; zbMATH DE number 1834571 (Why is no real title available?)
• scientific article; zbMATH DE number 1420813 (Why is no real title available?)
• Localized operational termination in general logics
• A dynamic approach to characterizing termination of general logic programs
• A SAT-Based Approach to Size Change Termination with Global Ranking Functions
• Termination Analysis of Logic Programs Based on Dependency Graphs
• scientific article; zbMATH DE number 970705 (Why is no real title available?)
• Program Development in Computational Logic
• Logic Based Program Synthesis and Transformation
• Termination of floating-point computations
• Mechanizing and improving dependency pairs

This page was built for publication: A general framework for automatic termination analysis od logic programs

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