论文信息 - Decomposition Ordering as a Tool to Prove the Termination of Rewriting Systems

Decomposition Ordering as a Tool to Prove the Termination of Rewriting Systems

Decomposition ordering is a well-founded monotonic ordering on terms. Because it has the subterm and the deletion properties, decomposition ordering is useful to prove termination of rewriting systems. An algorithm comparing two terms is given.

Pierre Lescanne | P. Lescanne

[1] Philippe Flajolet,et al. On the analysis of tree-matching algorithms , 1980, CLAAP.

[2] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.

[3] G. Huet,et al. Equations and rewrite rules: a survey , 1980 .

[4] Alberto Pettorossi. Comparing and Putting Together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems , 1981, ICALP.

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

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

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

[8] Gérard P. Huet,et al. A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm , 1981, J. Comput. Syst. Sci..