Non-termination in Term Rewriting and Logic Programming
From MaRDI portal
Publication:6493567
DOI10.1007/S10817-023-09693-ZWikidataQ128701768 ScholiaQ128701768MaRDI QIDQ6493567
Publication date: 29 April 2024
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Cites Work
- Termination of string rewriting proved automatically
- Loop detection in term rewriting using the eliminating unfoldings
- Termination of rewriting
- An analysis of loop checking mechanisms for logic programs
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Parallel program schemata
- Proving Non-looping Non-termination Automatically
- On Proving Uniform Termination and Restricted Termination of Rewriting Systems
- Term Rewriting and All That
- Non-Looping String Rewriting
- A semantic basis for the termination analysis of logic programs
- Guided unfoldings for finding loops in standard term rewriting
This page was built for publication: Non-termination in Term Rewriting and Logic Programming
