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

DOI10.1007/978-3-319-21401-6_7zbMath1465.68125OpenAlexW1466362228MaRDI QIDQ3454085

Masahiko Sakai, Michio Oyamaguchi, Mizuhito Ogawa

Publication date: 2 December 2015

Published in: Automated Deduction - CADE-25 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21401-6_7

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Conditions for confluence of innermost terminating term rewriting systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent
• Simple second-order languages for which unification is undecidable
• Differential dynamic logic for hybrid systems
• Syntacticness, cycle-syntacticness and shallow theories
• A fully syntactic AC-RPO.
• Confluence of Non-Left-Linear TRSs via Relative Termination
• On the complexity of integer programming
• A new parallel closed condition for Church-Rosser of left-linear term rewriting systems
• Development closed critical pairs
• Confluence by Critical Pair Analysis
• The Confluence Problem for Flat TRSs
• Computer Science Logic
• Tree-Manipulating Systems and Church-Rosser Theorems
• Confluence without termination via parallel critical pairs

This page was built for publication: Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent