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

          • 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

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

              A Unification Algorithm for Associative-Commutative Functions

                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
                124c9d3d-d77f-4e49-9336-db5d24398bfe
                © 1985

                http://www.elsevier.com/tdm/userlicense/1.0/

                History

                Comments

                Comment on this article