Modular termination of basic narrowing

4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Basic narrowing is a restricted form of narrowing which constrains narrowing steps to a set of non-blocked (or basic) positions. Basic narrowing has a number of important applications including equational unification in canonical theories. Another application is analyzing termination of narrowing by checking the termination of basic narrowing, as done in pioneering work by Hullot. In this work, we study the modularity of termination of basic narrowing in hierarchical combinations of TRSs, including a generalization of proper extensions with shared subsystem. This provides new algorithmic criteria to prove termination of basic narrowing. © 2008 Springer-Verlag.

Cite

CITATION STYLE

APA

Alpuente, M., Escobar, S., & Iborra, J. (2008). Modular termination of basic narrowing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5117 LNCS, pp. 1–16). https://doi.org/10.1007/978-3-540-70590-1_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free