首页    期刊浏览 2024年11月10日 星期日
登录注册

文章基本信息

  • 标题:A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems
  • 本地全文:下载
  • 作者:Takahito Aoto ; Yoshihito Toyama
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2011
  • 卷号:10
  • 页码:91-106
  • DOI:10.4230/LIPIcs.RTA.2011.91
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:We give a method to prove confluence of term rewriting systems that contain non-terminating rewrite rules such as commutativity and associativity. Usually, confluence of term rewriting systems containing such rules is proved by treating them as equational term rewriting systems and considering E-critical pairs and/or termination modulo E. In contrast, our method is based solely on usual critical pairs and usual termination. We first present confluence criteria for term rewriting systems whose rewrite rules can be partitioned into terminating part and possibly non-terminating part. We then give a reduction-preserving completion procedure so that the applicability of the criteria is enhanced. In contrast to the well-known Knuth-Bendix completion procedure which preserves the equivalence relation of the system, our completion procedure preserves the reduction relation of the system, by which confluence of the original system is inferred from that of the completed system.
  • 关键词:Confluence; Completion; Equational Term Rewriting Systems; Confluence Modulo Equations
国家哲学社会科学文献中心版权所有