{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:16:56Z","timestamp":1725733016053},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642390708"},{"type":"electronic","value":"9783642390715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39071-5_27","type":"book-chapter","created":{"date-parts":[[2013,6,24]],"date-time":"2013-06-24T01:23:17Z","timestamp":1372036997000},"page":"365-376","source":"Crossref","is-referenced-by-count":2,"title":["The Complexity of Theorem Proving in Autoepistemic Logic"],"prefix":"10.1007","author":[{"given":"Olaf","family":"Beyersdorff","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-31485-8_1","volume-title":"Lectures on Logic and Computation","author":"O. Beyersdorff","year":"2012","unstructured":"Beyersdorff, O., Kutz, O.: Proof complexity of non-classical logics. In: Bezhanishvili, N., Goranko, V. (eds.) ESSLLI 2010\/2011. LNCS, vol.\u00a07388, pp. 1\u201354. Springer, Heidelberg (2012)"},{"issue":"7","key":"27_CR2","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s00153-011-0245-8","volume":"50","author":"O. Beyersdorff","year":"2011","unstructured":"Beyersdorff, O., Meier, A., M\u00fcller, S., Thomas, M., Vollmer, H.: Proof complexity of propositional default logic. Archive for Mathematical Logic\u00a050(7), 727\u2013742 (2011)","journal-title":"Archive for Mathematical Logic"},{"issue":"3","key":"27_CR3","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1093\/logcom\/exq061","volume":"22","author":"O. Beyersdorff","year":"2012","unstructured":"Beyersdorff, O., Meier, A., Thomas, M., Vollmer, H.: The complexity of reasoning for fragments of default logic. Journal of Logic and Computation\u00a022(3), 587\u2013604 (2012)","journal-title":"Journal of Logic and Computation"},{"key":"27_CR4","unstructured":"Bonatti, P.A.: A Gentzen system for non-theorems. Technical Report CD\/TR 93\/52, Christian Doppler Labor f\u00fcr Expertensysteme (1993)"},{"issue":"2","key":"27_CR5","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 Transactions on Computational Logic\u00a03(2), 226\u2013278 (2002)","journal-title":"ACM Transactions on Computational Logic"},{"issue":"6","key":"27_CR6","doi-asserted-by":"publisher","first-page":"1939","DOI":"10.1137\/S0097539798353230","volume":"29","author":"M.L. Bonet","year":"2000","unstructured":"Bonet, M.L., Pitassi, T., Raz, R.: On interpolation and automatization for Frege systems. SIAM Journal on Computing\u00a029(6), 1939\u20131967 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Cook, S.A., Nguyen, P.: Logical Foundations of Proof Complexity. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511676277"},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"36","DOI":"10.2307\/2273702","volume":"44","author":"S.A. Cook","year":"1979","unstructured":"Cook, S.A., Reckhow, R.A.: The relative efficiency of propositional proof systems. The Journal of Symbolic Logic\u00a044(1), 36\u201350 (1979)","journal-title":"The Journal of Symbolic Logic"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Creignou, N., Meier, A., Vollmer, H., Thomas, M.: The complexity of reasoning for fragments of autoepistemic logic. ACM Transactions on Computational Logic\u00a013(2) (2012)","DOI":"10.1145\/2159531.2159539"},{"issue":"3","key":"27_CR10","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1145\/377978.377987","volume":"2","author":"U. Egly","year":"2001","unstructured":"Egly, U., Tompits, H.: Proof-complexity results for nonmonotonic reasoning. ACM Transactions on Computational Logic\u00a02(3), 340\u2013387 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"key":"27_CR11","first-page":"68","volume":"39","author":"G. Gentzen","year":"1935","unstructured":"Gentzen, G.: Untersuchungen \u00fcber das logische Schlie\u00dfen. Mathematische Zeitschrift\u00a039, 68\u2013131 (1935)","journal-title":"Mathematische Zeitschrift"},{"issue":"3","key":"27_CR12","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 and Computation\u00a02(3), 397\u2013425 (1992)","journal-title":"Journal of Logic and Computation"},{"issue":"4","key":"27_CR13","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":"2-3","key":"27_CR14","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.apal.2008.09.013","volume":"157","author":"P. Hrube\u0161","year":"2009","unstructured":"Hrube\u0161, P.: On lengths of proofs in non-classical logics. Annals of Pure and Applied Logic\u00a0157(2-3), 194\u2013205 (2009)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"1-2","key":"27_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.apal.2008.10.005","volume":"159","author":"E. Je\u0159\u00e1bek","year":"2009","unstructured":"Je\u0159\u00e1bek, E.: Substitution Frege and extended Frege proof systems in non-classical logics. Annals of Pure and Applied Logic\u00a0159(1-2), 1\u201348 (2009)","journal-title":"Annals of Pure and Applied Logic"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Kraj\u00ed\u010dek, J.: Bounded Arithmetic, Propositional Logic, and Complexity Theory. Encyclopedia of Mathematics and Its Applications, vol.\u00a060. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511529948"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/malq.19900360106","volume":"36","author":"J. Kraj\u00ed\u010dek","year":"1990","unstructured":"Kraj\u00ed\u010dek, J., Pudl\u00e1k, P.: Quantified propositional calculi and fragments of bounded arithmetic. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik\u00a036, 29\u201346 (1990)","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"27_CR18","volume-title":"Nonmonotonic Logics\u2014Context-Dependent Reasoning","author":"V.W. Marek","year":"1993","unstructured":"Marek, V.W., Truszczy\u0144ski, M.: Nonmonotonic Logics\u2014Context-Dependent Reasoning. Springer, Heidelberg (1993)"},{"key":"27_CR19","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. Artificial Intelligence\u00a025, 75\u201394 (1985)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39071-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T02:46:25Z","timestamp":1563245185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39071-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642390708","9783642390715"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39071-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}