Termination of logic programs: Transformational methods revisited

DOI10.1007/s002000100064zbMath0973.68029MaRDI 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 programs; well-moded logic programs

Mathematics Subject Classification ID

68Q42: Grammars and rewriting systems

68N17: Logic programming

Related Items

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, Proving termination by dependency pairs and inductive theorem proving, Modular termination proofs for rewriting using dependency pairs, Transformation for Refining Unraveled Conditional Term Rewriting Systems, Formalizing Soundness and Completeness of Unravelings, Termination of Isabelle Functions via Termination of Rewriting, From Outermost Termination to Innermost Termination, Proving Termination of Integer Term Rewriting, Foundations of the rule-based system ρLog