{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T21:29:02Z","timestamp":1726522142043},"reference-count":26,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3978,"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":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00383-8","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T16:25:18Z","timestamp":1034007918000},"page":"591-627","source":"Crossref","is-referenced-by-count":5,"title":["Propositional default logics made easier: computational complexity of model checking"],"prefix":"10.1016","volume":"289","author":[{"given":"Robert","family":"Baumgartner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Gottlob","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00383-8_BIB1","unstructured":"R. Baumgartner, G. Gottlob, On the complexity of model checking for propositional default logics: new results and tractable cases, Proc. of IJCAI-99, 1999, pp. 64\u201369."},{"key":"10.1016\/S0304-3975(01)00383-8_BIB2","unstructured":"R. Baumgartner, Contributions to the complexity analysis of non-monotonic reasoning, DBAI Technical Report DBAI-TR-2000-40."},{"key":"10.1016\/S0304-3975(01)00383-8_BIB3","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0743-1066(93)90029-G","article-title":"A survey on complexity results for non-monotonic logics","volume":"17","author":"Cadoli","year":"1993","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(01)00383-8_BIB4","doi-asserted-by":"crossref","unstructured":"E. Dantsin, T. Eiter, G. Gottlob, A. Voronkov, Complexity and expressive power of logic programming, Proc. of 12th IEEE, 1997.","DOI":"10.1109\/CCC.1997.612304"},{"issue":"3\/4","key":"10.1016\/S0304-3975(01)00383-8_BIB5","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01536399","article-title":"On the computational cost of disjunctive logic programming: propositional case","volume":"15","author":"Eiter","year":"1995","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/S0304-3975(01)00383-8_BIB6","unstructured":"M. Gelfond, H. Przymusi\u0144ska, V. Lifschitz, M. Truszczy\u0144ski, Disjunctive defaults, Proc. KR-2, 1991."},{"key":"10.1016\/S0304-3975(01)00383-8_BIB7","unstructured":"G. Gogic, H. Kautz, C. Papadimitriou, B. Selman, The comparative linguistics of knowledge representation, Proc. of IJCAI\u201995, 1995."},{"key":"10.1016\/S0304-3975(01)00383-8_BIB8","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1093\/logcom\/2.3.397","article-title":"Complexity results for nonmonotonic logics","volume":"2\/3","author":"Gottlob","year":"1992","journal-title":"J. Logic Comput."},{"key":"10.1016\/S0304-3975(01)00383-8_BIB9","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1006\/inco.1995.1124","article-title":"The complexity of default reasoning under the stationary fixed point semantics","volume":"121","author":"Gottlob","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(01)00383-8_BIB10","first-page":"712","article-title":"Translating default logic into standard autoepistemic logic","volume":"42\/4","author":"Gottlob","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(01)00383-8_BIB11","doi-asserted-by":"crossref","unstructured":"J.Y. Halpern, M.Y. Vardi, Model checking vs. theorem proving: a manifesto, Proc. of KR-2, 1991, pp. 325\u2013333.","DOI":"10.1016\/B978-0-12-450010-5.50015-3"},{"key":"10.1016\/S0304-3975(01)00383-8_BIB12","doi-asserted-by":"crossref","unstructured":"K. Inoue, C. Sakama, Relating disjunctive logic programs to default theories, in: L.M. Pereira (Ed.), Logic Programming and Non-monotonic Reasoning, Proc. Second Internat. Workshop, Anil Neirode, 1993, pp. 266\u2013282.","DOI":"10.7551\/mitpress\/4307.003.0023"},{"key":"10.1016\/S0304-3975(01)00383-8_BIB13","doi-asserted-by":"crossref","unstructured":"T. Janhunen, On the intertranslatability of autoepistemic, default and priority logics, and parallel, circumscription, Proc. of JELIA\u201998, 1998.","DOI":"10.1007\/3-540-49545-2_15"},{"key":"10.1016\/S0304-3975(01)00383-8_BIB14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0004-3702(91)90011-8","article-title":"Hard problems for simple default logics","volume":"49","author":"Kautz","year":"1991","journal-title":"Artif. Intell."},{"key":"10.1016\/S0304-3975(01)00383-8_BIB15","unstructured":"P. Liberatore, M. Schaerf, The complexity of model checking for propositional default logics, Proc. of ECAI\u201998, 1998."},{"key":"10.1016\/S0304-3975(01)00383-8_BIB16","doi-asserted-by":"crossref","unstructured":"V. Marek, M. Truszczy\u0144ski, Relating autoepistemic and default logic, Proc. of KR-1, 1990.","DOI":"10.1007\/BF01531081"},{"key":"10.1016\/S0304-3975(01)00383-8_BIB17","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"},{"year":"1993","series-title":"Nonmonotonic logics, Context Dependent Reasoning","author":"Marek","key":"10.1016\/S0304-3975(01)00383-8_BIB18"},{"key":"10.1016\/S0304-3975(01)00383-8_BIB19","doi-asserted-by":"crossref","unstructured":"I. Niemel\u00e4, Towards automatic autoepistemic reasoning, Logics in Artificial Intelligence, Springer, Berlin, 1991, pp. 428\u2013443.","DOI":"10.1007\/BFb0018457"},{"year":"1993","series-title":"Computational complexity","author":"Papadimitriou","key":"10.1016\/S0304-3975(01)00383-8_BIB20"},{"key":"10.1016\/S0304-3975(01)00383-8_BIB21","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":"Artif. Intell."},{"key":"10.1016\/S0304-3975(01)00383-8_BIB22","unstructured":"R. Rosati, Model checking for non-monotonic logics: algorithms and complexity, Proc. of IJCAI-99, 1999, pp. 76\u201381."},{"key":"10.1016\/S0304-3975(01)00383-8_BIB23","unstructured":"B. Selman, Tractable default reasoning, Doctoral Thesis, University of Toronto, 1990."},{"key":"10.1016\/S0304-3975(01)00383-8_BIB24","unstructured":"J. Stillman, It's not my default: the complexity of membership problems in restricted propositional default logic, Proc. of AAAI-90, 1990, pp. 571\u2013578."},{"key":"10.1016\/S0304-3975(01)00383-8_BIB25","unstructured":"J. Stillman, The complexity of propositional default logics, Proc. of AAAI-92, 1992, pp. 794\u2013799."},{"issue":"5","key":"10.1016\/S0304-3975(01)00383-8_BIB26","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1137\/0219058","article-title":"Bounded query classes","volume":"19","author":"Wagner","year":"1990","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003838?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003838?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T11:46:18Z","timestamp":1703936778000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501003838"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501003838"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00383-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}