22
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Termination of String Rewriting Proved Automatically

      Journal of Automated Reasoning
      Springer Science and Business Media LLC

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references9

          • Record: found
          • Abstract: not found
          • Book Chapter: not found

          Automated Termination Proofs with AProVE

            Bookmark
            • Record: found
            • Abstract: not found
            • Book Chapter: not found

            Dependency Pairs Revisited

              Bookmark
              • Record: found
              • Abstract: not found
              • Book Chapter: not found

              Matchbox: A Tool for Match-Bounded String Rewriting

                Bookmark

                Author and article information

                Journal
                Journal of Automated Reasoning
                J Autom Reasoning
                Springer Science and Business Media LLC
                0168-7433
                1573-0670
                December 2005
                February 28 2006
                December 2005
                : 34
                : 2
                : 105-139
                Article
                10.1007/s10817-005-6545-0
                b2667685-1fad-4390-80c7-21065f7d4752
                © 2005

                http://www.springer.com/tdm

                History

                Comments

                Comment on this article