@inproceedings{3bd592a9d5e14097bf5361c7fb1eaedc,
title = "A path ordering for proving termination of term rewriting systems",
abstract = "A new partial ordering scheme for proving uniform termination of term rewriting systems is presented. The basic idea is that two terms are compared by comparing the paths through them. It is shown that the ordering is a well-founded simplification ordering and also a strict extension of the recursive path ordering scheme of Dershowitz. Terms can be compared under this path ordering in polynomial time.",
author = "D. Kapur and P. Narendran and G. Sivakumar",
note = "Publisher Copyright: {\textcopyright} 1985, Springer-Verlag.; International Joint Conference on Theory and Practice of Software Development, TAPSOFT 1985 ; Conference date: 25-03-1985 Through 29-03-1985",
year = "1985",
doi = "10.1007/3-540-15198-2\_11",
language = "English",
isbn = "9783540151982",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "173--187",
editor = "James Thatcher and Hartmut Ehrig and Christiane Floyd and Maurice Nivat",
booktitle = "Mathematical Foundations of Software Development",
}