{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:24Z","timestamp":1725664164574},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590422"},{"type":"electronic","value":"9783540491750"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59042-0_74","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:58:59Z","timestamp":1330257539000},"page":"205-216","source":"Crossref","is-referenced-by-count":6,"title":["On compact representations of propositional circumscription"],"prefix":"10.1007","author":[{"given":"Marco","family":"Cadoli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco M.","family":"Donini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Schaerf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0020-0190(92)90049-2","volume":"44","author":"M. Cadoli","year":"1992","unstructured":"M. Cadoli. The complexity of model checking for circumscriptive formulae. Information Processing Letters, 44:113\u2013118, 1992.","journal-title":"Information Processing Letters"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"T. Eiter and G. Gottlob. Propositional circumscription and extended closed world reasoning are \u03a0 2 p -complete. Theoretical Computer Science, pages 231\u2013245, 1993.","DOI":"10.1016\/0304-3975(93)90073-3"},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0004-3702(89)90068-4","volume":"38","author":"M. Gelfond","year":"1989","unstructured":"M. Gelfond, H. Przymusinska, and T. Przymusinsky. On the relationship between circumscription and negation as failure. Artificial Intelligence Journal, 38:49\u201373, 1989.","journal-title":"Artificial Intelligence Journal"},{"key":"18_CR4","volume-title":"Handbook of Theoretical Computer Science, volume A, chapter 2","author":"D. S. Johnson","year":"1990","unstructured":"D. S. Johnson. A catalog of complexity classes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, chapter 2. Elsevier Science Publishers (North-Holland), Amsterdam, 1990."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"R. M. Karp and R. J. Lipton. Some connections between non-uniform and uniform complexity classes. In Proc. of the 12th ACM Sym. on Theory of Computing (STOC-80), pages 302\u2013309, 1980.","DOI":"10.1145\/800141.804678"},{"key":"18_CR6","unstructured":"H. A. Kautz and B. Selman. Forming concepts for fast inference. In Proc. of the 10th Nat. Conf. on Artificial Intelligence (AAAI-92), pages 786\u2013793, 1992."},{"issue":"1","key":"18_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/78935.78936","volume":"37","author":"P. G. Kolaitis","year":"1990","unstructured":"P. G. Kolaitis and C. H. Papadimitriou. Some computational aspects of circumscription. Journal of the ACM, 37(1):1\u201314, 1990.","journal-title":"Journal of the ACM"},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0020-0190(88)90085-3","volume":"27","author":"T. Krishnaprasad","year":"1988","unstructured":"T. Krishnaprasad. On the computability of circumscription. Information Processing Letters, 27:237\u2013243, 1988.","journal-title":"Information Processing Letters"},{"key":"18_CR9","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(86)90068-8","volume":"30","author":"H. J. Levesque","year":"1986","unstructured":"H. J. Levesque. Making believers out of computers. Artificial Intelligence Journal, 30:81\u2013108, 1986.","journal-title":"Artificial Intelligence Journal"},{"key":"18_CR10","unstructured":"V. Lifschitz. Computing circumscription. In Proc. of the 9th Int. Joint Conf. on Artificial Intelligence (IJCAI-85), pages 121\u2013127, 1985."},{"key":"18_CR11","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 Journal, 13:27\u201339, 1980.","journal-title":"Artificial Intelligence Journal"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"J. Minker. On indefinite databases and the closed world assumption. In Proc. of the 6th Conf. on Automated Deduction (CADE-82), pages 292\u2013308, 1982.","DOI":"10.1007\/BFb0000066"},{"key":"18_CR13","unstructured":"Y. Moses and M. Tennenholtz. Off-line reasoning for on-line efficiency. In Proc. of the 13th Int. Joint Conf. on Artificial Intelligence (IJCAI-93), pages 490\u2013495, 1993."},{"key":"18_CR14","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0004-3702(89)90070-2","volume":"38","author":"A. Rabinov","year":"1989","unstructured":"A. Rabinov. A generalization of collapsible cases of circumscription. Artificial Intelligence Journal, 38:111\u2013117, 1989.","journal-title":"Artificial Intelligence Journal"},{"key":"18_CR15","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00244994","volume":"1","author":"A. Yahya","year":"1985","unstructured":"A. Yahya and L. J. Henschen. Deduction in non-Horn databases. Journal of Automated Reasoning, 1:141\u2013160, 1985.","journal-title":"Journal of Automated Reasoning"},{"key":"18_CR16","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0304-3975(83)90020-8","volume":"26","author":"C. K. Yap","year":"1983","unstructured":"C. K. Yap. Some consequences of non-uniform conditions on uniform classes. Theoretical Computer Science, 26:287\u2013300, 1983.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","STACS 95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59042-0_74.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:25:14Z","timestamp":1605630314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59042-0_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590422","9783540491750"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-59042-0_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}