Abstract
LSE narrowing is known as an optimal narrowing strategy for arbitrary unconditional canonical term rewrite systems without additional properties such as orthogonality or constructor discipline. In this paper, we extend LSE narrowing to confluent and decreasing conditional term rewrite systems.
Cite
CITATION STYLE
APA
Bockmayr, A., & Werner, A. (1995). LSE narrowing for decreasing conditional term rewrite systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 968, pp. 51–70). Springer Verlag. https://doi.org/10.1007/3-540-60381-6_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free