{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:36:45Z","timestamp":1725665805432},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642283314"},{"type":"electronic","value":"9783642283321"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-28332-1_33","type":"book-chapter","created":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T09:45:36Z","timestamp":1330508736000},"page":"389-400","source":"Crossref","is-referenced-by-count":2,"title":["On the Parameterized Complexity of Default Logic and Autoepistemic Logic"],"prefix":"10.1007","author":[{"given":"Arne","family":"Meier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heribert","family":"Vollmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"18","key":"33_CR1","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1016\/j.ipl.2009.06.015","volume":"109","author":"O. Beyersdorff","year":"2009","unstructured":"Beyersdorff, O., Meier, A., Thomas, M., Vollmer, H.: The Complexity of Propositional Implication. Information Processing Letters\u00a0109(18), 1071\u20131077 (2009)","journal-title":"Information Processing Letters"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Beyersdorff, O., Meier, A., Thomas, M., Vollmer, H.: The complexity of reasoning for fragments of default logic. J. Log. Comput. (2011), doi:10.1093\/logcom\/exq061","DOI":"10.1093\/logcom\/exq061"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: Handb. Theor. Comp. Science. Formal Models and Semantics, pp. 193\u2013242. Elsevier (1990)","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Creignou, N., Meier, A., Thomas, M., Vollmer, H.: The complexity of reasoning for fragments of autoepistemic logic. ACM Transaction on Computational Logic\u00a013(2) (2010), \n                    \n                      http:\/\/tocl.acm.org\/accepted\/457meier.pdf","DOI":"10.1145\/2159531.2159539"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Elberfeld, M., Jakoby, A., Tantau, T.: Logspace versions of the theorems of Bodlaender and Courcelle. In: Proc. 51th FOCS. IEEE Computer Society (2010)","DOI":"10.1109\/FOCS.2010.21"},{"key":"33_CR6","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"issue":"3","key":"33_CR7","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. J. Log. Comput.\u00a02(3), 397\u2013425 (1992)","journal-title":"J. Log. Comput."},{"issue":"1","key":"33_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.artint.2009.10.003","volume":"174","author":"G. Gottlob","year":"2010","unstructured":"Gottlob, G., Pichler, R., Wei, F.: Bounded treewidth as a key to tractability of knowledge representation and reasoning. Artif. Intell.\u00a0174(1), 105\u2013132 (2010)","journal-title":"Artif. Intell."},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0004-3702(85)90042-6","volume":"25","author":"R.C. Moore","year":"1985","unstructured":"Moore, R.C.: Semantical considerations on modal logic. Art. Int.\u00a025, 75\u201394 (1985)","journal-title":"Art. Int."},{"key":"33_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/BFb0018457","volume-title":"Logics in AI","author":"I. Niemel\u00e4","year":"1991","unstructured":"Niemel\u00e4, I.: Towards Automatic Autoepistemic Reasoning. In: van Eijck, J. (ed.) JELIA 1990. LNCS, vol.\u00a0478, pp. 428\u2013443. Springer, Heidelberg (1991)"},{"key":"33_CR11","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":"33_CR12","unstructured":"Stockhusen, C.: Anwendungen monadischer Logik zweiter Stufe auf Probleme beschr\u00e4nkter Baumweite und deren Platzkomplexit\u00e4t. Diplomarbeit (2011)"},{"key":"33_CR13","first-page":"53","volume":"102","author":"M. Thomas","year":"2010","unstructured":"Thomas, M., Vollmer, H.: Complexity of non-monotonic logic. Bulletin of the EATCS\u00a0102, 53\u201382 (2010)","journal-title":"Bulletin of the EATCS"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28332-1_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T04:27:17Z","timestamp":1556425637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28332-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642283314","9783642283321"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28332-1_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}