Knuth-Bendix completion is a well-known technique to produce a canonical term rewriting system from a given set T of equations. One of the major problems in this approach is that Knuth-Bendix completion can result in an infinite set of rewrite rules. This problem has been well studied and various approaches that try to cope with infinite sets of rules have been proposed. In this abstract we present a different way of dealing with divergent term rewriting systems.
On dealing with divergent rewrite systems
1992
Abstract
Knuth-Bendix completion is a well-known technique to produce a canonical term rewriting system from a given set T of equations. One of the major problems in this approach is that Knuth-Bendix completion can result in an infinite set of rewrite rules. This problem has been well studied and various approaches that try to cope with infinite sets of rules have been proposed. In this abstract we present a different way of dealing with divergent term rewriting systems.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_453768-doc_174506.pdf
solo utenti autorizzati
Descrizione: On dealing with divergent rewrite systems
Tipologia:
Versione Editoriale (PDF)
Dimensione
151.11 kB
Formato
Adobe PDF
|
151.11 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
