Termination of logic programs: Transformational methods revisited

DOI10.1007/S002000100064MaRDI QIDQ5941754zbMATH OpenOpenAlexFDO

Authors Enno Ohlebusch

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/s002000100064

zbMATH Keywords

termination of logic programswell-moded logic programs

Mathematics Subject Classification ID

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

Recommendations

• Transformational methodology for proving termination of logic programs
• scientific article; zbMATH DE number 408800
• A methodology for proving termination of logic programs
• scientific article; zbMATH DE number 1696776
• Automated Termination Analysis for Logic Programs by Term Rewriting
• scientific article; zbMATH DE number 176506
• Termination proofs for logic programs
• scientific article; zbMATH DE number 1149425
• Program Development in Computational Logic

Cited in

(23)

• Modular termination proofs for rewriting using dependency pairs
• Transformation for refining unraveled conditional term rewriting systems
• On termination of functional symbol-free logic programs
• Automated termination proofs for logic programs by term rewriting
• Formalizing soundness and completeness of unravelings
• Termination of Isabelle functions via termination of rewriting
• Automated Termination Analysis for Logic Programs by Term Rewriting
• From Outermost Termination to Innermost Termination
• Proving Termination of Integer Term Rewriting
• Foundations of the rule-based system \(\rho\,\text{Log}\)
• Transformational methodology for proving termination of logic programs
• Real_Impl
• scientific article; zbMATH DE number 408800 (Why is no real title available?)
• Termination of logic programs: the never-ending story
• Proving termination by dependency pairs and inductive theorem proving
• Checking termination of bottom-up evaluation of logic programs with function symbols
• Using linear constraints for logic program termination analysis
• Completion after program inversion of injective functions
• Termination Analysis by Dependency Pairs and Inductive Theorem Proving
• On proving soundness of the computationally equivalent transformation for normal conditional term rewriting systems by using unravelings
• Logic programming with function symbols: checking termination of bottom-up evaluation through program adornments
• Termination proofs of well-moded logic programs via conditional rewrite systems
• Termination of generalized term rewriting systems

This page was built for publication: Termination of logic programs: Transformational methods revisited

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