Automatic termination proofs with transformation orderings

DOI10.1007/3-540-59200-8_44zbMath1503.68157OpenAlexW1522871112MaRDI QIDQ5055814

Joachim Steinbach

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59200-8_44

Mathematics Subject Classification ID

Searching and sorting (68P10) Game theory (91A99) Grammars and rewriting systems (68Q42)

Related Items (5)

Termination of constructor systems ⋮ Unnamed Item ⋮ Termination of term rewriting using dependency pairs ⋮ Automating the dependency pair method ⋮ Termination by absence of infinite chains of dependency pairs

Cites Work

• Termination by completion
• Termination of rewriting
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Automatic termination proofs with transformation orderings