Non-termination in Term Rewriting and Logic Programming

DOI10.1007/S10817-023-09693-ZMaRDI QIDQ6493567zbMATH OpenWikidataFDO

Authors Étienne Payet

Publication date 29 April 2024

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10817-023-09693-Z

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator
• Non-termination Analysis of Logic Programs Using Types
• Static Analysis
• A non-termination criterion for binary constraint logic programs
• A new approach to non-termination analysis of logic programs

Cites work

• A semantic basis for the termination analysis of logic programs
• An analysis of loop checking mechanisms for logic programs
• Analyzing program termination and complexity automatically with \textsf{AProVE}
• Guided unfoldings for finding loops in standard term rewriting
• Loop detection in term rewriting using the eliminating unfoldings
• Non-Looping String Rewriting
• On Proving Uniform Termination and Restricted Termination of Rewriting Systems
• Parallel program schemata
• Proving Non-looping Non-termination Automatically
• Term Rewriting and All That
• Termination of rewriting
• Termination of string rewriting proved automatically

This page was built for publication: Non-termination in Term Rewriting and Logic Programming

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