{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:08:33Z","timestamp":1761620913302},"publisher-location":"Berlin\/Heidelberg","reference-count":23,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540571841"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022579","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T01:14:45Z","timestamp":1131844485000},"page":"313-324","source":"Crossref","is-referenced-by-count":1,"title":["Nonmonotonic reasoning is sometimes simpler"],"prefix":"10.1007","author":[{"given":"Grigori","family":"Schwarz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miroslaw","family":"Truszczy\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"T. Eiter and G. Gottlob. Propositional circumscription and extended closed world reasoning are \u03a02\/p-complete. To appear in Theoretical Comp. Sci."},{"key":"33_CR2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.3233\/FI-1992-171-204","volume":"17","author":"T. Eiter","year":"1992","unstructured":"T. Eiter and G. Gottlob. Complexity of reasoning with parsimonious and moderately grounded expansions. Fundamenta Informaticae, 17, 31\u201353, 1992.","journal-title":"Fundamenta Informaticae"},{"key":"33_CR3","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability; a guide to the theory of NP-completeness. W.H. Freeman, 1979."},{"key":"33_CR4","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1093\/logcom\/2.3.397","volume":"2","author":"G. Gottlob","year":"1992","unstructured":"G. Gottlob. Complexity results for nonmonotonic logics. Journal of Logic and Computation, 2:397\u2013425, 1992.","journal-title":"Journal of Logic and Computation"},{"key":"33_CR5","volume-title":"A companion to modal logic","author":"G.E. Hughes","year":"1984","unstructured":"G.E. Hughes and M.J. Cresswell. A companion to modal logic. Methuen and Co. Ltd., London, 1984."},{"key":"33_CR6","unstructured":"J.Y. Halpern and Y. Moses. A guide to modal logics of knowledge and belief. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pages 480\u2013490. Morgan Kaufmann, 1985."},{"key":"33_CR7","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1137\/0206033","volume":"6","author":"R. Ladner","year":"1977","unstructured":"R. Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM J. Comp., 6:467\u2013480, 1977.","journal-title":"SIAM J. Comp."},{"key":"33_CR8","volume-title":"volume 30 of Acta Philosophica Fennica","author":"W. Lenzen","year":"1978","unstructured":"W. Lenzen. Recent Work in Epistemic Logic, volume 30 of Acta Philosophica Fennica. North-Holland, Amsterdam, 1978."},{"key":"33_CR9","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF00205012","volume":"14","author":"W. Lenzen","year":"1979","unstructured":"W. Lenzen. Epistemologische Betrachtungen zu [S4, S5]. Erkenntnis, 14:33\u201356, 1979.","journal-title":"Erkenntnis"},{"key":"33_CR10","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J. McCarthy","year":"1980","unstructured":"J. McCarthy. Circumscription \u2014 a form of non-monotonic reasoning. Artificial Intelligence, 13:27\u201339, 1980.","journal-title":"Artificial Intelligence"},{"key":"33_CR11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/322290.322293","volume":"29","author":"D. McDermott","year":"1982","unstructured":"D. McDermott. Nonmonotonic logic II: Nonmonotonic modal theories. Journal of the ACM, 29:33\u201357, 1982.","journal-title":"Journal of the ACM"},{"key":"33_CR12","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(80)90012-0","volume":"13","author":"D. McDermott","year":"1980","unstructured":"D. McDermott and J. Doyle. Nonmonotonic logic I. Artificial Intelligence, 13:41\u201372, 1980.","journal-title":"Artificial Intelligence"},{"key":"33_CR13","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0004-3702(85)90042-6","volume":"25","author":"R.C. Moore","year":"1985","unstructured":"R.C. Moore. Semantical considerations on non-monotonic logic. Artificial Intelligence, 25:75\u201394, 1985.","journal-title":"Artificial Intelligence"},{"key":"33_CR14","first-page":"395","volume-title":"Modal nonmonotonic logics: ranges, characterization, computation","author":"W. Marek","year":"1991","unstructured":"W. Marek, G.F. Shvarts, and M. Truszczy\u0144ski. Modal nonmonotonic logics: ranges, characterization, computation. In Second International Conference on Principles of Knowledge Representation and Reasoning, KR '91, pages 395\u2013404, San Mateo, CA., 1991. Morgan Kaufmann. An extended version of this article will appear in the Journal of the ACM."},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"W. Marek and M. Truszczy\u0144ski. Nonmonotonic Logics; Context-Dependent Reasoning. Springer-Verlag, 1993. To appear.","DOI":"10.1007\/978-3-662-02906-0"},{"key":"33_CR16","doi-asserted-by":"crossref","first-page":"117","DOI":"10.3233\/FI-1992-171-208","volume":"17","author":"I. Niemel\u00e4","year":"1992","unstructured":"I. Niemel\u00e4. On the decidability and complexity of autoepistemic reasoning. Fundamenta Informaticae, 17:117\u2013155, 1992.","journal-title":"Fundamenta Informaticae"},{"key":"33_CR17","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"R. Reiter. A logic for default reasoning. Artificial Intelligence, 13:81\u2013132, 1980.","journal-title":"Artificial Intelligence"},{"key":"33_CR18","unstructured":"K. Segerberg. An essay in classical modal logic. Uppsala University, Filosofiska Studier, 13, 1971."},{"key":"33_CR19","first-page":"97","volume-title":"Proceedings of TARK 1990","author":"G.F. Shvarts","year":"1990","unstructured":"G.F. Shvarts. Autoepistemic modal logics. In R. Parikh, editor, Proceedings of TARK 1990, pages 97\u2013109, San Mateo, CA., 1990. Morgan Kaufmann."},{"key":"33_CR20","first-page":"184","volume-title":"Proceedings of TARK 1992","author":"G.F. Schwarz","year":"1992","unstructured":"G.F. Schwarz and M. Truszczy\u0144ski. Modal logic S4F and the minimal knowledge paradigm. In Y. Moses, editor, Proceedings of TARK 1992, pages 184\u2013198, San Mateo, CA., 1992. Morgan Kaufmann."},{"key":"33_CR21","unstructured":"G.F. Schwarz and M. Truszczy\u0144ski. Subnormal modal logics for knowledge representation. In Proceedings of AAAI-93. To appear."},{"key":"33_CR22","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1145\/115234.115350","volume":"38","author":"M. Tiomkin","year":"1991","unstructured":"M. Tiomkin and M. Kaminski. Nonmonotonic default modal logics. Journal of the ACM, 38:963\u2013984, 1991.","journal-title":"Journal of the ACM"},{"key":"33_CR23","first-page":"393","volume-title":"Proceedings of IJCAI-91","author":"M. Truszczy\u0144ski","year":"1991","unstructured":"M. Truszczy\u0144ski. Modal interpretations of default logic. In Proceedings of IJCAI-91, pages 393\u2013398, San Mateo, CA., 1991. Morgan Kaufmann."}],"container-title":["Lecture Notes in Computer Science","Computational Logic and Proof Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022579.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T12:13:08Z","timestamp":1626696788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022579"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540571841"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0022579","relation":{},"subject":[]}}