Modular Termination Proofs for Rewriting Using Dependency Pairs

ISSN： 0747-7171

Source： Journal of Symbolic Computation, Vol.34, Iss.1, 2002-07, pp. : 21-58

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Termination of term rewriting using dependency pairs

By Arts T. Giesl J.

Theoretical Computer Science, Vol. 236, Iss. 1, 2000-04 ,pp. : 133-178

Elsevier

Access to resources Recommend Favorite

Modular proofs for completeness of hierarchical term rewriting systems

By Rao M.R.K.K.

Theoretical Computer Science, Vol. 151, Iss. 2, 1995-11 ,pp. : 487-512

Elsevier

Access to resources Recommend Favorite

Proving Termination by Dependency Pairs and Inductive Theorem Proving

By Fuhs Carsten

Journal of Automated Reasoning, Vol. 47, Iss. 2, 2011-08 ,pp. : 133-160

Springer Publishing Company

Access to resources Recommend Favorite

Modular termination of r-consistent and left-linear term rewriting systems

By Schmidt-Schausz M. Marchiori M. Panitz S.E.

Theoretical Computer Science, Vol. 149, Iss. 2, 1995-10 ,pp. : 361-374

Elsevier

Access to resources Recommend Favorite

Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths

By Weiermann A.

Theoretical Computer Science, Vol. 139, Iss. 1, 1995-03 ,pp. : 355-362

Elsevier

Access to resources Recommend Favorite