Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems

DOI10.1007/11814771_30zbMath1222.68366OpenAlexW1495283197MaRDI QIDQ3613418

Adam Koprowski, Hans Zantema

Publication date: 12 March 2009

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

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.482.8396

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Size-based termination of higher-order rewriting ⋮ Root-Labeling ⋮ Transforming SAT into Termination of Rewriting ⋮ Innermost Termination of Rewrite Systems by Labeling

Uses Software

• AProVE
• TORPA