Abstract
The relationship between several simplification orderings is investigated: PSO, RPO, RDO. RDO is improved in order to deal with more pairs of terms, and made more efficient and easy to handle, by removing useless computations.
Cite
CITATION STYLE
APA
Rusinowitch, M. (1985). Path of subterms ordering and recursive decomposition ordering revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 202 LNCS, pp. 225–240). Springer Verlag. https://doi.org/10.1007/3-540-15976-2_10
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