The Church-Rosser property for ground term-rewriting systems is decidable

Theoretical Computer Science ◽

10.1016/0304-3975(87)90100-9 ◽

1987 ◽

Vol 49 (1) ◽

pp. 43-79 ◽

Author(s):

Michio Oyamaguchi

Keyword(s):

Term Rewriting ◽

Ground Term ◽

Term Rewriting Systems ◽

Rewriting Systems ◽

Download Full-text

Decidability of confluence for ground term rewriting systems

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/bfb0028794 ◽

2006 ◽

pp. 80-89 ◽

Author(s):

M. Dauchet ◽

S. Tison

Keyword(s):

Term Rewriting ◽

Ground Term ◽

Term Rewriting Systems ◽

Rewriting Systems

Download Full-text

A new decidability technique for ground term rewriting systems with applications

ACM Transactions on Computational Logic ◽

10.1145/1042038.1042042 ◽

2005 ◽

Vol 6 (1) ◽

pp. 102-123 ◽

Author(s):

Rakesh Verma ◽

Ara Hayrapetyan

Keyword(s):

Term Rewriting ◽

Ground Term ◽

Term Rewriting Systems ◽

Rewriting Systems

Download Full-text

Compilation of ground term rewriting systems and applications (DEMO)

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-51081-8_137 ◽

1989 ◽

pp. 556-558 ◽

Author(s):

M. Dauchet ◽

A. Deruyver

Keyword(s):

Term Rewriting ◽

Ground Term ◽

Term Rewriting Systems ◽

Rewriting Systems

Download Full-text

Confluence of Right Ground Term Rewriting Systems Is Decidable

Foundations of Software Science and Computational Structures - Lecture Notes in Computer Science ◽

10.1007/978-3-540-31982-5_30 ◽

2005 ◽

pp. 470-489 ◽

Author(s):

Lukasz Kaiser

Keyword(s):

Term Rewriting ◽

Ground Term ◽

Term Rewriting Systems ◽

Rewriting Systems

Download Full-text

On the Church-Rosser property for the direct sum of term rewriting systems

Journal of the ACM ◽

10.1145/7531.7534 ◽

1987 ◽

Vol 34 (1) ◽

pp. 128-143 ◽

Author(s):

Yoshihito Toyama

Keyword(s):

Term Rewriting ◽

Term Rewriting Systems ◽

Rewriting Systems ◽

Download Full-text

The Unification Problem for Confluent Right-Ground Term Rewriting Systems

Rewriting Techniques and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-45127-7_19 ◽

2001 ◽

pp. 246-260 ◽

Author(s):

Michio Oyamaguchi ◽

Yoshikatsu Ohta

Keyword(s):

Term Rewriting ◽

Ground Term ◽

Term Rewriting Systems ◽

Rewriting Systems ◽

Unification Problem

Download Full-text

The unification problem for confluent right-ground term rewriting systems

Information and Computation ◽

10.1016/s0890-5401(03)00022-1 ◽

2003 ◽

Vol 183 (2) ◽

pp. 187-211 ◽

Author(s):

Michio Oyamaguchi ◽

Yoshikatsu Ohta

Keyword(s):

Term Rewriting ◽

Ground Term ◽

Term Rewriting Systems ◽

Rewriting Systems ◽

Unification Problem

Download Full-text

Derivation Trees of Ground Term Rewriting Systems

Information and Computation ◽

10.1006/inco.1998.2786 ◽

1999 ◽

Vol 152 (1) ◽

pp. 1-15 ◽

Author(s):

Joost Engelfriet

Keyword(s):

Term Rewriting ◽

Ground Term ◽

Term Rewriting Systems ◽

Rewriting Systems

Download Full-text

Conditional Term Rewriting Systems

10.1007/3-540-56393-8 ◽

1993 ◽

Keyword(s):

Term Rewriting ◽

Term Rewriting Systems ◽

Rewriting Systems ◽

Conditional Term ◽

Conditional Term Rewriting

Download Full-text

Semantics and strong sequentiality of priority term rewriting systems

Theoretical Computer Science ◽

10.1016/s0304-3975(98)00080-2 ◽

1998 ◽

Vol 208 (1-2) ◽

pp. 87-110 ◽

Author(s):

Masahiko Sakai ◽

Yoshihito Toyama

Keyword(s):

Term Rewriting ◽

Term Rewriting Systems ◽

Rewriting Systems

Download Full-text