Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Termination of String Rewriting Proved Automatically

Termination of String Rewriting Proved Automatically This paper describes how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method, and semantic labelling can be used for automatically proving termination of an extensive class of string rewriting systems (SRSs). The tool implementing this combination of techniques is called TORPA: Termination of Rewriting Proved Automatically. All termination proofs generated by TORPA are easy to read and check; but for many of the SRSs involved, finding a termination proof would be a hard job for a human. This paper contains all underlying theory, describes how the search for a termination proof is implemented, and includes many examples. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Automated Reasoning Springer Journals

Termination of String Rewriting Proved Automatically

Journal of Automated Reasoning , Volume 34 (2) – Feb 28, 2006

Loading next page...
 
/lp/springer-journals/termination-of-string-rewriting-proved-automatically-MGPLPu3Zuj

References (36)

Publisher
Springer Journals
Copyright
Copyright © 2006 by Springer
Subject
Computer Science; Mathematical Logic and Formal Languages; Symbolic and Algebraic Manipulation; Artificial Intelligence (incl. Robotics); Mathematical Logic and Foundations
ISSN
0168-7433
eISSN
1573-0670
DOI
10.1007/s10817-005-6545-0
Publisher site
See Article on Publisher Site

Abstract

This paper describes how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method, and semantic labelling can be used for automatically proving termination of an extensive class of string rewriting systems (SRSs). The tool implementing this combination of techniques is called TORPA: Termination of Rewriting Proved Automatically. All termination proofs generated by TORPA are easy to read and check; but for many of the SRSs involved, finding a termination proof would be a hard job for a human. This paper contains all underlying theory, describes how the search for a termination proof is implemented, and includes many examples.

Journal

Journal of Automated ReasoningSpringer Journals

Published: Feb 28, 2006

There are no references for this article.