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

      Matrix Interpretations for Proving Termination of Term Rewriting

      , ,
      Journal of Automated Reasoning
      Springer Nature

      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.

          Abstract

          Related collections

          Most cited references10

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

          AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework

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

            The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Automating the dependency pair method

                Bookmark

                Author and article information

                Journal
                Journal of Automated Reasoning
                J Autom Reasoning
                Springer Nature
                0168-7433
                1573-0670
                March 2008
                December 2007
                : 40
                : 2-3
                : 195-220
                Article
                10.1007/s10817-007-9087-9
                7327a837-45d0-44a1-ad3c-b9f01e287058
                © 2008
                History

                Comments

                Comment on this article