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

      On the complexity of propositional knowledge base revision, updates, and counterfactuals

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

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

          On the logic of theory change: Partial meet contraction and revision functions

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

            Circumscription—A form of non-monotonic reasoning

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

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

                Bookmark

                Author and article information

                Journal
                Artificial Intelligence
                Artificial Intelligence
                Elsevier BV
                00043702
                October 1992
                October 1992
                : 57
                : 2-3
                : 227-270
                Article
                10.1016/0004-3702(92)90018-S
                df000cfd-84e8-4f08-bd04-c8561c26dbe0
                © 1992

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

                History

                Comments

                Comment on this article