Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems

DOI10.1007/11814771_30MaRDI QIDQ3613418zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 794240
• TPA: Termination Proved Automatically
• Innermost termination of rewrite systems by labeling
• scientific article; zbMATH DE number 1670496
• Modular and certified semantic labeling and unlabeling

Cited in

(8)

• Innermost termination of rewrite systems by labeling
• Root-Labeling
• Predictive Labeling
• Semantic labelling for proving termination of combinatory reduction systems
• Size-based termination of higher-order rewriting
• scientific article; zbMATH DE number 794240 (Why is no real title available?)
• Transforming SAT into termination of rewriting
• scientific article; zbMATH DE number 6792369 (Why is no real title available?)

Describes a project that uses

Uses Software

• AProVE
• TORPA

This page was built for publication: Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems

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