{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:58:29Z","timestamp":1725533909554},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027765"},{"type":"electronic","value":"9783642027772"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02777-2_7","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T06:58:18Z","timestamp":1245999498000},"page":"51-64","source":"Crossref","is-referenced-by-count":4,"title":["The Complexity of Reasoning for Fragments of Default Logic"],"prefix":"10.1007","author":[{"given":"Olaf","family":"Beyersdorff","sequence":"first","affiliation":[]},{"given":"Arne","family":"Meier","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Thomas","sequence":"additional","affiliation":[]},{"given":"Heribert","family":"Vollmer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"7_CR1","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/954092.954101","volume":"34","author":"E. B\u00f6hler","year":"2003","unstructured":"B\u00f6hler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with Boolean blocks, part I: Post\u2019s lattice with applications to complexity theory. SIGACT News\u00a034(4), 38\u201352 (2003)","journal-title":"SIGACT News"},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(02)00189-3","volume":"139","author":"R. Ben-Eliyahu-Zohary","year":"2002","unstructured":"Ben-Eliyahu-Zohary, R.: Yet some more complexity results for default logic. Artificial Intelligence\u00a0139(1), 1\u201320 (2002)","journal-title":"Artificial Intelligence"},{"key":"7_CR3","unstructured":"Beyersdorff, O., Meier, A., Thomas, M., Vollmer, H.: The complexity of propositional implication. ACM Computing Research Repository, arXiv:0811.0959v1 [cs.CC] (2008)"},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1145\/505372.505374","volume":"3","author":"P.A. Bonatti","year":"2002","unstructured":"Bonatti, P.A., Olivetti, N.: Sequent calculi for propositional nonmonotonic logics. ACM Trans. Comput. Logic\u00a03(2), 226\u2013278 (2002)","journal-title":"ACM Trans. Comput. Logic"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-540-72200-7_7","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"P. Chapdelaine","year":"2007","unstructured":"Chapdelaine, P., Hermann, M., Schnoor, I.: Complexity of default logic on generalized conjunctive queries. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS, vol.\u00a04483, pp. 58\u201370. Springer, Heidelberg (2007)"},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1093\/logcom\/2.3.397","volume":"2","author":"G. Gottlob","year":"1992","unstructured":"Gottlob, G.: Complexity results for nonmonotonic logics. Journal of Logic Computation\u00a02(3), 397\u2013425 (1992)","journal-title":"Journal of Logic Computation"},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1145\/210332.210334","volume":"42","author":"G. Gottlob","year":"1995","unstructured":"Gottlob, G.: Translating default logic into standard autoepistemic logic. J. ACM\u00a042(4), 711\u2013740 (1995)","journal-title":"J. ACM"},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0004-3702(88)90021-5","volume":"35","author":"K. Konolige","year":"1988","unstructured":"Konolige, K.: On the relation between default and autoepistemic logic. Artificial Intelligence\u00a035(3), 343\u2013382 (1988); Erratum: Artificial Intelligence 41(1), 115","journal-title":"Artificial Intelligence"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0004-3702(91)90011-8","volume":"49","author":"H.A. Kautz","year":"1991","unstructured":"Kautz, H.A., Selman, B.: Hard problems for simple default logics. Artificial Intelligence\u00a049, 243\u2013279 (1991)","journal-title":"Artificial Intelligence"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01744287","volume":"13","author":"H. Lewis","year":"1979","unstructured":"Lewis, H.: Satisfiability problems for propositional calculi. Mathematical Systems Theory\u00a013, 45\u201353 (1979)","journal-title":"Mathematical Systems Theory"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J. McCarthy","year":"1980","unstructured":"McCarthy, J.: Circumscription \u2013 a form of non-monotonic reasoning. Artificial Intelligence\u00a013, 27\u201339 (1980)","journal-title":"Artificial Intelligence"},{"key":"7_CR12","series-title":"Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02906-0","volume-title":"Nonmonotonic Logic","author":"V.W. Marek","year":"1993","unstructured":"Marek, V.W., Truszczy\u0144ski, M.: Nonmonotonic Logic. Artificial Intelligence. Springer, Heidelberg (1993)"},{"key":"7_CR13","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"7_CR14","first-page":"1","volume":"5","author":"E. Post","year":"1941","unstructured":"Post, E.: The two-valued iterative systems of mathematical logic. Annals of Mathematical Studies\u00a05, 1\u2013122 (1941)","journal-title":"Annals of Mathematical Studies"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"Reiter, R.: A logic for default reasoning. Artificial Intelligence\u00a013, 81\u2013132 (1980)","journal-title":"Artificial Intelligence"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0304-3975(82)90039-1","volume":"19","author":"A.L. Selman","year":"1982","unstructured":"Selman, A.L.: Reductions on NP and p-selective sets. Theoretical Computer Science\u00a019, 287\u2013304 (1982)","journal-title":"Theoretical Computer Science"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Sridhar, R., Iyengar, S.: Efficient parallel algorithms for functional dependency manipulations. In: Proc. 2nd DPDS, pp. 126\u2013137 (1990)","DOI":"10.1109\/DPDS.1990.113704"},{"key":"7_CR18","unstructured":"Stillman, J.: It\u2019s not my default: The complexity of membership problems in restricted propositional default logics. In: Proc. 8th AAAI, pp. 571\u2013578 (1990)"},{"key":"7_CR19","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03927-4","volume-title":"Introduction to Circuit Complexity","author":"H. Vollmer","year":"1999","unstructured":"Vollmer, H.: Introduction to Circuit Complexity. Texts in Theoretical Computer Science. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02777-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T00:54:07Z","timestamp":1552092847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02777-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027765","9783642027772"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02777-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}