Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories
We present decidability results for termination of classes of term rewriting systems modulo permutative theories. Termination and innermost termination modulo permutative theories are shown to be decidable for term rewrite systems (TRS) whose right-hand side terms are restricted to be shallow (varia...
Gardado en:
| Principais autores: | , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
Logical Methods in Computer Science e.V.
2010-08-01
|
| Series: | Logical Methods in Computer Science |
| Assuntos: | |
| Acceso en liña: | https://lmcs.episciences.org/821/pdf |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|