{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:05:12Z","timestamp":1747548312681},"reference-count":32,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5829,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,8]]},"DOI":"10.1016\/s0304-3975(96)00182-x","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"183-202","source":"Crossref","is-referenced-by-count":15,"title":["On compact representations of propositional circumscription"],"prefix":"10.1016","volume":"182","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"}]},{"given":"Riccardo","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00182-X_BIB1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0020-0190(92)90049-2","article-title":"The complexity of model checking for circumscriptive formulae","volume":"44","author":"Cadoli","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(96)00182-X_BIB2","series-title":"Proc. 14th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS-95)","first-page":"151","article-title":"The size of a revised knowledge base","author":"Cadoli","year":"1995"},{"key":"10.1016\/S0304-3975(96)00182-X_BIB3","series-title":"Proc. 12th National Conf. on Artifical Intelligence (AAAI-94)","first-page":"946","article-title":"Is intractability of non-monotonic reasoning a real drawback?","author":"Cadoli","year":"1995"},{"key":"10.1016\/S0304-3975(96)00182-X_BIB4","series-title":"12th Symp. on Theoretical Aspects of Computer Science (STACS-95)","first-page":"205","article-title":"On compact representations of propositional circumscription","author":"Cadoli","year":"1995"},{"key":"10.1016\/S0304-3975(96)00182-X_BIB5","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0004-3702(96)00009-4","article-title":"Is intractability of non-monotonic reasoning a real drawback?","volume":"88","author":"Cadoli","year":"1996","journal-title":"Artifical Intelligence J."},{"key":"10.1016\/S0304-3975(96)00182-X_BIB6","series-title":"Proc. 14th Internat. Joint Conf. on Artifical Intelligence (IJCAI-95)","first-page":"1502","article-title":"Computing circumscription revisited: a reduction algorithm","author":"Doherty","year":"1995"},{"key":"10.1016\/S0304-3975(96)00182-X_BIB7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(93)90073-3","article-title":"Propositional circumscription and extended closed world reasoning are \u03a0p2-complete","volume":"114","author":"Eiter","year":"1993","journal-title":"Theoret. Comput. sci."},{"key":"10.1016\/S0304-3975(96)00182-X_BIB8","series-title":"Proc. 3rd Internat. Conf. on the Principles of Knowledge Representation and Reasoning (KR-92)","first-page":"425","article-title":"Quantifier elimination in second-order predicate logic","author":"Gabbay","year":"1992"},{"key":"10.1016\/S0304-3975(96)00182-X_BIB9","series-title":"Proc. 5th Logic Programming Symp.","first-page":"1070","article-title":"The stable model semantics for logic programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/S0304-3975(96)00182-X_BIB10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0004-3702(89)90068-4","article-title":"On the relationship between circumscription and negation as failure","volume":"38","author":"Gelfond","year":"1989","journal-title":"Artificial Intelligence J."},{"key":"10.1016\/S0304-3975(96)00182-X_BIB11","article-title":"A catalog of complexity classes","volume":"Vol. A","author":"Johnson","year":"1990"},{"key":"10.1016\/S0304-3975(96)00182-X_BIB12","series-title":"Proc. 12th ACM Symp. on Theory of Computing (STOC-80)","first-page":"302","article-title":"Some connections between non-uniform and uniform complexity classes","author":"Karp","year":"1980"},{"key":"10.1016\/S0304-3975(96)00182-X_BIB13","series-title":"Proc. 10th Natl. Conf. on Artifcial Intelligence (AAAI-92)","first-page":"786","article-title":"Forming concepts for fast inference","author":"Kautz","year":"1992"},{"key":"10.1016\/S0304-3975(96)00182-X_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/78935.78936","article-title":"Some computational aspects of circumscription","volume":"37","author":"Kolaitis","year":"1990","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(96)00182-X_BIB15","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0020-0190(88)90085-3","article-title":"On the computability of circumscription","volume":"27","author":"Krishnaprasad","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(96)00182-X_BIB16","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(86)90068-8","article-title":"Making believers out of computers","volume":"30","author":"Levesque","year":"1986","journal-title":"Artifical Intelligence J."},{"key":"10.1016\/S0304-3975(96)00182-X_BIB17","series-title":"Proc. 9th Internat. Joint Conf. on Artificial Intelligence (IJCAI-85)","first-page":"121","article-title":"Computing circumscription","author":"Lifschitz","year":"1985"},{"key":"10.1016\/S0304-3975(96)00182-X_BIB18","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1145\/116825.116836","article-title":"Autoepistemic logic","volume":"38","author":"Marek","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(96)00182-X_BIB19","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","article-title":"Circumscription \u2014 a form of non-monotonic reasoning","volume":"13","author":"McCarthy","year":"1980","journal-title":"Artifical Intelligence J."},{"key":"10.1016\/S0304-3975(96)00182-X_BIB20","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","article-title":"Applications of circumscription to formalizing common-sense knowledge","volume":"28","author":"McCarthy","year":"1986","journal-title":"Aritifical Intelligence J."},{"key":"10.1016\/S0304-3975(96)00182-X_BIB21","series-title":"Proc. 6th Internat. Conf. on Automated Deduction (CADE-82)","first-page":"292","article-title":"On indefinite databases and the closed world assumption","author":"Minker","year":"1982"},{"key":"10.1016\/S0304-3975(96)00182-X_BIB22","series-title":"Proc. 13th Internat. Joint Conf. on Artifical Intelligence (IJCAI-93)","first-page":"490","article-title":"Off-line reasoning for on-line efficiency","author":"Moses","year":"1993"},{"key":"10.1016\/S0304-3975(96)00182-X_BIB23","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1006\/inco.1995.1005","article-title":"Computing circumscriptive databases. I: Theory and algorithms","volume":"116","author":"Nerode","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(96)00182-X_BIB24","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0743-1066(90)90031-Y","article-title":"Minimal consequence in sentential logic","volume":"9","author":"Papalaskari","year":"1990","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(96)00182-X_BIB25","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF03037171","article-title":"Stable semantics for disjunctive programs","volume":"9","author":"Przymusinski","year":"1991","journal-title":"New Generation Comput."},{"key":"10.1016\/S0304-3975(96)00182-X_BIB26","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0004-3702(89)90070-2","article-title":"A generalization of collapsible cases of circumscription","volume":"38","author":"Rabinov","year":"1989","journal-title":"Artificial Intelligence J."},{"key":"10.1016\/S0304-3975(96)00182-X_BIB27","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","article-title":"A logic for default reasoning","volume":"13","author":"Reiter","year":"1980","journal-title":"Artifical Intelligence J."},{"key":"10.1016\/S0304-3975(96)00182-X_BIB28","series-title":"Proc. 9th Natl. Conf. on Artifical Intelligence (AAAI-91)","first-page":"904","article-title":"Knowledge compilation using Horn approximations","author":"Selman","year":"1991"},{"key":"10.1016\/S0304-3975(96)00182-X_BIB29","series-title":"Proc. 4th Hawaii Symp. on Systems Science","first-page":"525","article-title":"On time hardware complexity tradeoffs for boolean functions","author":"Spira","year":"1971"},{"key":"10.1016\/S0304-3975(96)00182-X_BIB30","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","article-title":"The well-founded semantics for general logic programs","volume":"38","author":"van Gelder","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(96)00182-X_BIB31","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0304-3975(83)90020-8","article-title":"Some consequences of non-uniform conditions on uniform classes","volume":"26","author":"Yap","year":"1983","journal-title":"Theoret. Comput. sci."},{"key":"10.1016\/S0304-3975(96)00182-X_BIB32","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00244994","article-title":"Deduction in non-Horn databases","volume":"1","author":"Yahya","year":"1985","journal-title":"J. Autom. Reasoning"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759600182X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759600182X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T00:57:08Z","timestamp":1555376228000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759600182X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S030439759600182X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00182-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}