Skip to main content
SpringerLink
Log in
Book cover

International Conference on Automated Deduction

CADE 2015: Automated Deduction - CADE-25 pp 111–126Cite as

Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent

  • Conference paper
  • First Online:

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

Abstract

A term is weakly shallow if each defined function symbol occurs either at the root or in the ground subterms, and a term rewriting system is weakly shallow if both sides of a rewrite rule are weakly shallow. This paper proves that non-E-overlapping, weakly-shallow, and non-collapsing term rewriting systems are confluent by extending reduction graph techniques in our previous work [19] with towers of expansions.

The results without proofs are orally presented at IWC 2014 [20].

M. Ogawa—This work is supported by JSPS KAKENHI Grant Number 25540003.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Comon, H., Haberstrau, M., Jouannaud, J.-P.: Syntacticness, cycle-syntacticness, and shallow theories. Inf. Comput. 111, 154–191 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. Godoy, G., Tiwari, A.: Confluence of shallow right-linear rewrite systems. In: Ong, L. (ed.) CSL 2005. LNCS, vol. 3634, pp. 541–556. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Gomi, H., Oyamaguchi, M., Ohta, Y.: On the church-rosser property of root-E-overlapping and strongly depth-preserving term rewriting systems. IPS J 39(4), 992–1005 (1998)

    MathSciNet  Google Scholar 

  4. Gramlich, B.: Confluence without termination via parallel critical pairs. In: Kirchner, H. (ed.) CAAP 1996. LNCS, vol. 1059, pp. 211–225. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  5. Hirokawa, N., Middeldorp, A.: Decreasing diagrams and relative termination. J. Autom. Reason. 47(4), 481–501 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  6. Huet, G.: Confluent reductions: abstract properties and applications to term rewriting systems. J. ACM 27, 797–821 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  7. Klein, D., Hirokawa, N.: Confluence of non-left-linear TRSs via relative termination. In: Bjørner, N., Voronkov, A. (eds.) LPAR-18 2012. LNCS, vol. 7180, pp. 258–273. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  8. Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 263–297 (1970)

    Google Scholar 

  9. Klop, J.W.: Term Rewriting Systems, in Handbook of Logic in Computer Science, vol. 2. Oxford University Press, New York (1993)

    Google Scholar 

  10. Liu, J., Dershowitz, N., Jouannaud, J.-P.: Confluence by critical pair analysis. In: Dowek, G. (ed.) RTA-TLCA 2014. LNCS, vol. 8560, pp. 287–302. Springer, Heidelberg (2014)

    Google Scholar 

  11. Mitsuhashi, I., Oyamaguch, M., Jacquemard, F.: The confluence problem for flat TRSs. In: Calmet, J., Ida, T., Wang, D. (eds.) AISC 2006. LNCS (LNAI), vol. 4120, pp. 68–81. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Mitsuhashi, I., Oyamaguchi, M., Matsuura, K.: On the \(E\)-overlapping property of Wweak monadic TRSs. IPS J. 53(10), 2313–2327 (2012). (in Japanese)

    MATH  Google Scholar 

  13. Ogawa, M., Ono, S.: On the uniquely converging property of nonlinear term rewriting systems. Technical report of IEICE, COMP89–7, pp. 61–70 (1989)

    Google Scholar 

  14. Okui, S.: Simultaneous critical pairs and church-rosser property. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol. 1379, pp. 2–16. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  15. van Oostrom, V.: Development closed critical pairs. In: Dowek, G., Heering, J., Meinke, K., Möller, B. (eds.) HOA 1995. LNCS, vol. 1074, pp. 185–200. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  16. Oyamaguchi, M., Ohta, Y.: A new parallel closed condition for Church-Rosser of left-linear term rewriting systems. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 187–201. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  17. Rosen, B.K.: Tree-manipulating systems and Church-Rosser theorems. J. ACM 20, 160–187 (1973)

    Article  MATH  Google Scholar 

  18. Sakai, M., Wang, Y.: Undecidable properties on length-two string rewriting systems. ENTCS 204, 53–69 (2008)

    MathSciNet  MATH  Google Scholar 

  19. Sakai, M., Ogawa, M.: Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent. Inf. Process. Lett. 110, 810–814 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  20. Sakai, M., Oyamaguchi, M., Ogawa, M.: Non-E-overlapping and weakly shallow TRSs are confluent (extended abstract). IWC 34–38, 2014 (2014)

    MATH  Google Scholar 

  21. Toyama, Y.: Commutativity of term rewriting systems. In: Programming of Future Generation Computer II, pp. 393–407 (1988)

    Google Scholar 

  22. Toyama, Y., Oyamaguchi, M.: Church-Rosser property and unique normal form property of non-duplicating term rewriting systems. In: Lindenstrauss, N., Dershowitz, N. (eds.) CTRS 1994. LNCS, vol. 968, pp. 316–331. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Science, Nagoya University, Furo-cho, Chikusa-ku, Nagoya, 464-8603, Japan

    Masahiko Sakai & Michio Oyamaguchi

  2. Japan Advanced Institute of Science and Technology, 1-1 Asahidai, Nomi, Ishikawa, 923-1292, Japan

    Mizuhito Ogawa

Authors
  1. Masahiko Sakai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michio Oyamaguchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mizuhito Ogawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Masahiko Sakai .

Editor information

Editors and Affiliations

  1. University of Ottawa, Ottawa, Canada

    Amy P. Felty

  2. University of Innsbruck, Innsbruck, Austria

    Aart Middeldorp

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Sakai, M., Oyamaguchi, M., Ogawa, M. (2015). Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent. In: Felty, A., Middeldorp, A. (eds) Automated Deduction - CADE-25. CADE 2015. Lecture Notes in Computer Science(), vol 9195. Springer, Cham. https://doi.org/10.1007/978-3-319-21401-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21401-6_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21400-9

  • Online ISBN: 978-3-319-21401-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation