Termination of narrowing revisited

This paper describes several classes of term rewriting systems (TRS’s), where narrowing has a finite search space and is still (strongly) complete as a mechanism for solving reachability goals. These classes do not assume confluence of the TRS. We also ascertain purely syntactic criteria that suffic...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science 2009-11, Vol.410 (46), p.4608-4625
Hauptverfasser:	Alpuente, María, Escobar, Santiago, Iborra, José
Format:	Artikel
Sprache:	eng
Schlagworte:	Equational unification Narrowing Reachability problems Termination
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!