论文信息 - On Recursive Path Ordering

On Recursive Path Ordering

Abstract The ‘Recursive Path Ordering’ (RPO) scheme of Dershowitz is a powerful way of extending a partial order on a set of function symbols to a well-founded partial order on their set of terms. We prove that, given a pair of terms, the problem of deciding whether they can be made RPO-comparable, by choosing a partial order on their function symbols, is NP-complete.

Paliath Narendran | Mukkai S. Krishnamoorthy | P. Narendran | M. Krishnamoorthy

[1] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .

[2] Pierre Lescanne,et al. Computer experiments with the REVE term rewriting system generator , 1983, POPL '83.

[3] Paliath Narendran,et al. A Path Ordering for Proving Termination of Term Rewriting Systems , 1985, TAPSOFT, Vol.1.

[4] Nachum Dershowitz,et al. Orderings for term-rewriting systems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[5] Gerard Huet,et al. Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[6] Nachum Dershowitz. Orderings for Term-Rewriting Systems , 1979, FOCS.

[7] Gérard P. Huet,et al. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[8] Jean-Pierre Jouannaud,et al. Recursive Decomposition Ordering , 1982, Formal Description of Programming Concepts.

[9] Deepak Kapur,et al. On Proving Uniform Termination and Restricted Termination of Rewriting Systems , 1983, SIAM J. Comput..

[10] Gérard Huet,et al. On the Uniform Halting Problem for Term Rewriting Systems , 1978 .