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

      Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation

      , ,
      Information and Computation
      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 references36

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

          A Computing Procedure for Quantification Theory

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

            Classical negation in logic programs and disjunctive databases

              Bookmark
              • Record: found
              • Abstract: not found
              • Conference Proceedings: not found

              The complexity of relational query languages (Extended Abstract)

                Bookmark

                Author and article information

                Journal
                Information and Computation
                Information and Computation
                Elsevier BV
                08905401
                June 1997
                June 1997
                : 135
                : 2
                : 69-112
                Article
                10.1006/inco.1997.2630
                90cc47c5-d840-4266-981c-f466b6cb9424
                © 1997

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

                History

                Comments

                Comment on this article