Deciding Confluence and Normal Form Properties of Ground Term Rewrite Systems Efficiently

It is known that the first-order theory of rewriting is decidable for ground term rewrite systems, but the general technique uses tree automata and often takes exponential time. For many properties, including confluence (CR), uniqueness of normal forms with respect to reductions (UNR) and with respect to conversions (UNC), polynomial time decision procedures are known for ground term rewrite systems. However, this is not the case for the normal form property (NFP). In this work, we present a cubic time algorithm for NFP, an almost cubic time algorithm for UNR, and an almost linear time algorithm for UNC, improving previous bounds. We also present a cubic time algorithm for CR.

[1]  Bertram Felgenhauer,et al.  CSI: New Evidence - A Progress Report , 2017, CADE.

[2]  Massimo Marchiori.  On the Modularity of Normal Forms in Rewriting , 1996, J. Symb. Comput..

[3]  Jan Willem Klop,et al.  Comparing Curried and Uncurried Rewriting , 1993, J. Symb. Comput..

[4]  Michaël Rusinowitch,et al.  Algorithms and Reductions for Rewriting Problems , 1998, Fundam. Informaticae.

[5]  Guillem Godoy,et al.  Unique Normalization for Shallow TRS , 2009, RTA.

[6]  Robert Nieuwenhuis,et al.  The confluence of ground term rewrite systems is decidable in polynomial time , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[7]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[8]  Rakesh M. Verma.  Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems , 2009, Fundam. Informaticae.

[9]  Yoshihito Toyama,et al.  On the Church-Rosser property for the direct sum of term rewriting systems , 1984, JACM.

[10]  David A. Plaisted,et al.  Polynomial Time Termination and Constraint Satisfaction Tests , 1993, RTA.

[11]  Albert Oliveras,et al.  Fast congruence closure and extensions , 2007, Inf. Comput..

[12]  Bertram Felgenhauer.  Deciding Confluence of Ground Term Rewrite Systems in Cubic Time , 2012, RTA.

[13]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[14]  Greg Nelson,et al.  Fast Decision Procedures Based on Congruence Closure , 1980, JACM.

[15]  Ashish Tiwari.  Deciding confluence of certain term rewriting systems in polynomial time , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[16]  Chang Liu,et al.  Term rewriting and all that , 2000, SOEN.

[17]  Stefan Kahrs.  Confluence of Curried Term-Rewriting Systems , 1995, J. Symb. Comput..

[18]  Ashish Tiwari,et al.  On the Confluence of Linear Shallow Term Rewrite Systems , 2003, STACS.