@incollection{Pettorossi_1981,
doi = {10.1007/3-540-10843-2_35},
url = {https://doi.org/10.1007%2F3-540-10843-2_35},
year = {1981},
publisher = {Springer Berlin Heidelberg},
pages = {432--447},
author = {Alberto Pettorossi},
title = {Comparing and putting together recursive path ordering, simplification orderings and Non-Ascending Property for termination proofs of term rewriting systems},
booktitle = {Automata, Languages and Programming}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 07:51:09,
Build Time: N/A