Automated Termination Analysis for Logic Programs by Term Rewriting

DOI10.1007/978-3-540-71410-1_13MaRDI QIDQ3591084zbMATH OpenOpenAlexFDO

Authors Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann

Publication date 10 September 2007

Published in Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71410-1_13

Mathematics Subject Classification ID

Logic programming (68N17) Grammars and rewriting systems (68Q42)

Recommendations

• Automated termination proofs for logic programs by term rewriting
• Termination of logic programs: Transformational methods revisited
• Automated termination analysis for logic programs with cut
• Transformational methodology for proving termination of logic programs
• A general framework for automatic termination analysis od logic programs

Cited in

(30)

• Termination proofs for logic programs
• Transforming orthogonal inductive definition sets into confluent term rewrite systems
• Analyzing program termination and complexity automatically with \textsf{AProVE}
• A productivity checker for logic programming
• Automatic termination analysis for functional and imperative programs (Thesis, TU Darmstadt)
• scientific article; zbMATH DE number 1696593 (Why is no real title available?)
• Methods for proving termination of rewriting-based programming languages by transformation
• Automated termination proofs for logic programs by term rewriting
• Dependency triples for improving termination analysis of logic programs with cut
• Polytool: polynomial interpretations as a basis for termination analysis of logic programs
• Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
• Automated termination analysis for logic programs with cut
• Real_Impl
• scientific article; zbMATH DE number 408800 (Why is no real title available?)
• Proving termination by dependency pairs and inductive theorem proving
• scientific article; zbMATH DE number 1973218 (Why is no real title available?)
• scientific article; zbMATH DE number 1497822 (Why is no real title available?)
• A new approach to non-termination analysis of logic programs
• 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 773980 (Why is no real title available?)
• Termination of Narrowing in Left-Linear Constructor Systems
• Termination Analysis of Logic Programs Based on Dependency Graphs
• scientific article; zbMATH DE number 970705 (Why is no real title available?)
• Logic for Programming, Artificial Intelligence, and Reasoning
• Logic Based Program Synthesis and Transformation
• Termination of logic programs: Transformational methods revisited
• Characterizing and proving operational termination of deterministic conditional term rewriting systems
• Mechanizing and improving dependency pairs
• Termination of narrowing via termination of rewriting

This page was built for publication: Automated Termination Analysis for Logic Programs by Term Rewriting

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