Skip to main content
Springer Nature Link
Log in

Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules

  • Conference paper
Automated Deduction – CADE-20 (CADE 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3632))

Included in the following conference series:

  • 547 Accesses

Abstract

We show that termination is decidable for rewrite systems that contain shallow and right-linear rules, collapsing rules, and right-ground rules. This class of rewrite systems is expressive enough to include interesting rules. Our proof uses the fact that this class of rewrite systems is known to be regularity-preserving and hence the reachability and joinability problems are decidable. Decidability of termination is obtained by analyzing the nonterminating derivations.

The first author was partially supported by Spanish Min. of Educ. and Science by the LogicTools project (TIN2004-03382). The second author was supported in part by the National Science Foundation under grants ITR-CCR-0326540 and CCR-0311348.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Borralleras, C., Ferreira, M., Rubio, A.: Complete monotonic semantic path orderings. In: McAllester, D. (ed.) CADE 2000. LNCS, vol. 1831, Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  2. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications. Available on (1997), http://www.grappa.univ-lille3.fr/tata

  3. Contejean, E., Marche, C., Monate, B., Urbain, X.: CiME, http://cime.lri.fr/

  4. Dauchet, M.: Simulation of Turing machines by a regular rewrite rule. Theoretical Computer Science 103(2), 409–420 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dershowitz, N.: Termination of linear rewriting systems. In: Automata, Languages and Programming, 8th Colloquium, ICALP. LNCS, vol. 115, pp. 448–458. Springer, Heidelberg (1981)

    Google Scholar 

  6. Dershowitz, N.: Orderings for term rewriting systems. Theoretical computer science TCS 17(3), 279–301 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  7. Geser, A., Middeldorp, A., Ohlebusch, E., Zantema, H.: Relative undecidability in term rewriting, Part 1: The termination hierarchy. Information and Computation 178(1), 101–131 (2002)

    MATH  MathSciNet  Google Scholar 

  8. Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Automatic termination proofs with AProVE. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 210–220. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  9. Godoy, G., Tiwari, A.: Deciding fundamental properties of right-(Ground or variable) rewrite systems by rewrite closure. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol. 3097, pp. 91–106. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Godoy, G., Tiwari, A.: Confluence of shallow right-linear rewrite systems. In: Computer Science Logic, CSL, (2005) (to appear)

    Google Scholar 

  11. Godoy, G., Tiwari, A., Verma, R.: Deciding confluence of certain term rewriting systems in polynomial time. Annals of Pure and Applied Logic 130(1-3), 33–59 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  12. Hirokawa, N., Middeldorp, A.: Tsukuba termination tool. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 311–320. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Huet, G., Lankford, D.S.: On the uniform halting problem for term rewriting systems. INRIA, Le Chesnay, France, Technical Report 283 (1978)

    Google Scholar 

  14. Jacquemard, F.: Reachability and confluence are undecidable for flat term rewriting systems. Inf. Process. Lett. 87(5), 265–270 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  15. Middeldorp, A., Gramlich, B.: Simple termination is difficult. Applicable Algebra in Engineering, Communication, and Computing AAECC 6(2), 115–128 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  16. Plaisted, D.A.: Polynomial time termination and constraint satisfaction tests. In: Kirchner, C. (ed.) RTA 1993. LNCS, vol. 690, pp. 405–420. Springer, Heidelberg (1993)

    Google Scholar 

  17. 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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technical University of Catalonia, Jordi Girona 1, Barcelona, Spain

    Guillem Godoy

  2. SRI International, Menlo Park, CA, 94025, USA

    Ashish Tiwari

Authors
  1. Guillem Godoy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ashish Tiwari
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technical University of Catalonia, Barcelona

    Robert Nieuwenhuis

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Godoy, G., Tiwari, A. (2005). Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules. In: Nieuwenhuis, R. (eds) Automated Deduction – CADE-20. CADE 2005. Lecture Notes in Computer Science(), vol 3632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11532231_12

Download citation

  • DOI: https://doi.org/10.1007/11532231_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28005-7

  • Online ISBN: 978-3-540-31864-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics