Blog
About

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

      Refutational theorem proving using term-rewriting systems

      Artificial Intelligence

      Elsevier BV

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

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

          Complete Sets of Reductions for Some Equational Theories

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

            Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity

             James Slagle (1974)
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              A complete proof of correctness of the Knuth-Bendix completion algorithm

               Gérard Huet (1981)
                Bookmark

                Author and article information

                Journal
                Artificial Intelligence
                Artificial Intelligence
                Elsevier BV
                00043702
                March 1985
                March 1985
                : 25
                : 3
                : 255-300
                Article
                10.1016/0004-3702(85)90074-8
                © 1985

                Comments

                Comment on this article