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

      Linear-time algorithms for testing the satisfiability of propositional horn formulae

      ,
      The Journal of Logic Programming
      Elsevier BV

      Read this article at

      ScienceOpenPublisher
          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

          Author and article information

          Journal
          The Journal of Logic Programming
          The Journal of Logic Programming
          Elsevier BV
          07431066
          October 1984
          October 1984
          : 1
          : 3
          : 267-284
          Article
          10.1016/0743-1066(84)90014-1
          d56364a4-5489-46e5-9740-083edd099b1e
          © 1984
          History

          Comments

          Comment on this article

          Related Documents Log