Modular Termination Proofs for Rewriting Using Dependency Pairs

By Giesl J.   Arts T.   Ohlebusch E.  

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

Academic Press

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

Termination of String Rewriting Proved Automatically

By Zantema H.  

Journal of Automated Reasoning, Vol. 34, Iss. 2, 2005-12 ,pp. : 105-139

Springer Publishing Company

Access to resources Recommend Favorite