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

      On the power of clause-learning SAT solvers as resolution engines

      ,
      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 references16

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

          A machine program for theorem-proving

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

            Optimal speedup of Las Vegas algorithms

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

              The relative efficiency of propositional proof systems

              We are interested in studying the length of the shortest proof of a propositional tautology in various proof systems as a function of the length of the tautology. The smallest upper bound known for this function is exponential, no matter what the proof system. A question we would like to answer (but have not been able to) is whether this function has a polynomial bound for some proof system. (This question is motivated below.) Our results here are relative results.
                Bookmark

                Author and article information

                Journal
                Artificial Intelligence
                Artificial Intelligence
                Elsevier BV
                00043702
                February 2011
                February 2011
                : 175
                : 2
                : 512-525
                Article
                10.1016/j.artint.2010.10.002
                4ef65ab6-73b4-45fd-9aa9-2c83b3af50bb
                © 2011

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

                History

                Comments

                Comment on this article