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

      Answer Set Programming Based on Propositional Satisfiability

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

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

          A machine program for theorem-proving

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

            Classical negation in logic programs and disjunctive databases

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

              Negation as Failure

                Bookmark

                Author and article information

                Journal
                Journal of Automated Reasoning
                J Autom Reasoning
                Springer Nature
                0168-7433
                1573-0670
                January 2 2007
                September 29 2006
                : 36
                : 4
                : 345-377
                Article
                10.1007/s10817-006-9033-2
                19e119c4-3cd2-41e7-a701-d37fc9a78716
                © 2007
                History

                Comments

                Comment on this article