Term rewriting restricted to ground terms

✍ Scribed by Sándor Vágvölgyi

• Book ID: 104325702
• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 405 KB
• Volume: 302
• Category: Article
• ISSN: 0304-3975
• DOI: 10.1016/s0304-3975(02)00745-4

✦ Synopsis

We study rewriting of ground terms. For an arbitrary term rewrite system R over a ranked alphabet , we restrict the rewriting relation →R to ground terms. We introduce the relation

We show that for a given term rewrite system R and a given ground term rewrite system S over a ranked alphabet it is decidable if ↔ * R; g ⊆ ↔ * S . We show that for a given left-linear right-ground term rewrite system R over a ranked alphabet it is decidable if there is a ground term rewrite system S over such that → * R; g = → * S .