The confluence of ground term rewrite systems is decidable in polynomial time

2001 ◽  
Author(s):  
H. Comon ◽  
G. Godoy ◽  
R. Nieuwenhuis
Keyword(s):  
Polynomial Time ◽  
Ground Term ◽  
Rewrite Systems ◽  
Term Rewrite Systems

scholarly journals Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems

1990 ◽  
Vol 88 (2) ◽  
pp. 187-201 ◽  
Author(s):  
Max Dauchet ◽  
Thierry Heuillard ◽  
Pierre Lescanne ◽  
Sophie Tison
Keyword(s):  
Ground Term ◽  
Rewrite Systems ◽  
Term Rewrite Systems

Modular termination of prefix-constrained term rewrite systems

2022 ◽  
Vol 174 ◽  
pp. 106207
Author(s):  
Nirina Andrianarivelo ◽  
Pierre Réty
Keyword(s):  
Rewrite Systems ◽  
Term Rewrite Systems
Sign in / Sign up

Export Citation Format

Share Document