Termination of String Rewriting Proved Automatically

ISSN： 0168-7433

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

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 and derivational complexity of confluent one-rule string-rewriting systems

By Kobayashi Y. Katsura M. Shikishima-Tsuji K.

Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. : 583-632

Elsevier

Access to resources Recommend Favorite

Logical string rewriting

By Manca V.

Theoretical Computer Science, Vol. 264, Iss. 1, 2001-08 ,pp. : 25-51

Elsevier

Access to resources Recommend Favorite

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

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 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