Termination of logic programs: Transformational methods revisited

DOI10.1007/s002000100064zbMath0973.68029OpenAlexW2038040550MaRDI QIDQ5941754

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

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

Related Items (14)

Checking termination of bottom-up evaluation of logic programs with function symbols ⋮ Using linear constraints for logic program termination analysis ⋮ Formalizing Soundness and Completeness of Unravelings ⋮ Proving termination 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 ⋮ Completion after Program Inversion of Injective Functions ⋮ From Outermost Termination to Innermost Termination ⋮ Termination Analysis by Dependency Pairs and Inductive Theorem Proving ⋮ Termination of Isabelle Functions via Termination of Rewriting ⋮ Proving Termination of Integer Term Rewriting ⋮ Foundations of the rule-based system ρLog ⋮ Transformation for Refining Unraveled Conditional Term Rewriting Systems ⋮ Modular termination proofs for rewriting using dependency pairs

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