Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ENTCS
2008

favoriteEmaildiscussreport

85views more ENTCS 2008»

Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems

13 years 4 months ago

Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems

Download ir.nul.nagoya-u.ac.jp

Yi and Sakai [9] showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ground term rewriting systems. The decidability was shown by the fact that every non-terminating TRS in the class has a loop. In this paper we modify the proof of [9] to show that both innermost termination and

Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe

Real-time Traffic

Decidable Property | ENTCS 2008 | Right Ground Term | Term Rewriting Systems |

claim paper

Related Content

» Termination of Innermost ContextSensitive Rewriting Using Dependency Pairs

» Proving Termination Properties with muterm

» Orderings for Innermost Termination

» From Outermost Termination to Innermost Termination

» Proving Innermost Normalisation Automatically

» Improved Modular Termination Proofs Using Dependency Pairs

» A Proof of Weak Termination Providing the Right Way to Terminate

» Decision Procedures for Loop Detection

» Innermost Termination of Rewrite Systems by Labeling

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	ENTCS
Authors	Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe

Comments (0)