Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems

We consider several classes of term rewriting systems and prove that termination is decidable for these classes. By showing the cycling property of infinite dependency chains, we prove that termination is decidable for semi-constructor case, which is a superclass of right-ground TRSs. By analyzing argument propagation cycles in the dependency graph, we show that termination is also decidable for left-linear shallow TRSs. Moreover we extend these by combining these two techniques.

[1]  Larry Wos,et al.  What Is Automated Reasoning? , 1987, J. Autom. Reason..

[2]  Jürgen Giesl,et al.  Proving Innermost Normalisation Automatically , 1997, RTA.

[3]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[4]  Nachum Dershowitz.  Termination of Linear Rewriting Systems (Preliminary Version) , 1981, ICALP.

[5]  Takashi Nagaya,et al.  Decidability for Left-Linear Growing Term Rewriting Systems , 1998, Inf. Comput..

[6]  Yoshikatsu Ohta,et al.  The Joinability and Unification Problems for Confluent Semi-constructor TRSs , 2004, RTA.

[7]  Nao Hirokawa,et al.  Dependency Pairs Revisited , 2004, RTA.

[8]  Ashish Tiwari,et al.  Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules , 2005, CADE.

[9]  Aart Middeldorp,et al.  Approximating Dependency Graphs Using Tree Automata Techniques , 2001, IJCAR.

[10]  Yoshihito Toyama,et al.  Decidability for Left-Linaer Growing Term Rewriting Systems , 1999, RTA.

[11]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[12]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[13]  Jürgen Giesl,et al.  Termination of term rewriting using dependency pairs , 2000, Theor. Comput. Sci..

[14]  Florent Jacquemard,et al.  Decidable Approximations of Term Rewriting Systems , 1996, RTA.

[15]  Hiroyuki Seki,et al.  Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability , 2000, RTA.

[16]  Graham Steel,et al.  Deduction with XOR Constraints in Security API Modelling , 2005, CADE.

[17]  Gérard Huet,et al.  On the Uniform Halting Problem for Term Rewriting Systems , 1978 .

[18]  Michio Oyamaguchi,et al.  The reachability and related decision problems for monadic and semi-constructor TRSs , 2006, Inf. Process. Lett..