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

      Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints

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

          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

            A Computing Procedure for Quantification Theory

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

              Alloy: a lightweight object modelling notation

                Bookmark

                Author and article information

                Journal
                Journal of Automated Reasoning
                J Autom Reasoning
                Springer Nature
                0168-7433
                1573-0670
                January 2008
                September 2007
                : 40
                : 1
                : 1-33
                Article
                10.1007/s10817-007-9084-z
                1a4a0e01-1bb6-46f4-b630-3b7c5e6f26a2
                © 2008
                History

                Comments

                Comment on this article