How to transform canonical decreasing ctrss into equivalent canonical trss

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

Abstract

We prove constructively that the class of ground-confluent and decreasing conditional term rewriting systems (CTRSs) (without extra variables) coincides with the class of orthogonal and terminating, unconditional term rewriting systems (TRSs). TRSs being included in CTRSs, this result follows from a transformation from any groundconfluent and decreasing CTRS specifying a computable function f into a TRS with the mentioned properties for f. The generated TRS is ordersorted, but we outline a similar transformation yielding an unsorted TRS.

Cite

CITATION STYLE

APA

Hintermeier, C. (1995). How to transform canonical decreasing ctrss into equivalent canonical trss. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 968, pp. 186–205). Springer Verlag. https://doi.org/10.1007/3-540-60381-6_11

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