Advertisement

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

  • Yi Wang
  • Masahiko Sakai
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4098)

Abstract

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.

Keywords

Decision Procedure Dependency Graph Function Symbol Label Function Smoothness Condition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236, 133–178 (2000)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press, Cambridge (1998)Google Scholar
  3. 3.
    Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997), http://www.grappa.univ-lille3.fr/tata/
  4. 4.
    Dershowitz, N.: Termination of linear rewriting systems. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 448–458. Springer, Heidelberg (1981)Google Scholar
  5. 5.
    Godoy, G., Tiwari, A.: Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 164–176. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  6. 6.
    Hirokawa, N., Middeldorp, A.: Dependency Pairs Revisited. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 249–268. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  7. 7.
    Huet, G., Lankford, D.: On the uniform halting problem for term rewriting systems. Technical Report 283 INRIA (1978)Google Scholar
  8. 8.
    Jacquemard, F.: Decidable approximations of term rewriting systems. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol. 1103, pp. 362–376. Springer, Heidelberg (1996)Google Scholar
  9. 9.
    Middeldorp, A.: Approximating dependency graphs using tree automata techniques. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 593–610. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  10. 10.
    Nagaya, T., Toyama, Y.: Decidability for left-linear growing term rewriting systems. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol. 1631, pp. 256–270. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  11. 11.
    Mitsuhashi, I., Oyamaguchi, M., Ohta, Y., Yamada, T.: The joinability and unification problems for confluent semi-constructor TRSs. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 285–300. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  12. 12.
    Mitsuhashi, I., Oyamaguchi, M., Yamada, T.: The reachability and related decision problems for monadic and semi-constructor TRSs. Information Processing Letters 98, 219–224 (2006)CrossRefMathSciNetMATHGoogle Scholar
  13. 13.
    Takai, T., Kaji, Y., Seki, H.: Right-linear finite path overlapping term rewriting systems effectively preserve recognizability. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol. 1833, pp. 246–260. Springer, Heidelberg (2000)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yi Wang
    • 1
  • Masahiko Sakai
    • 1
  1. 1.Graduate School of Information ScienceNagoya UniversityFuro-cho, Chikusa-ku, NagoyaJapan

Personalised recommendations