{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T12:30:17Z","timestamp":1718627417539},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"7-8","license":[{"start":{"date-parts":[[2011,7,3]],"date-time":"2011-07-03T00:00:00Z","timestamp":1309651200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s00153-011-0245-8","type":"journal-article","created":{"date-parts":[[2011,7,4]],"date-time":"2011-07-04T05:45:01Z","timestamp":1309758301000},"page":"727-742","source":"Crossref","is-referenced-by-count":6,"title":["Proof complexity of propositional default logic"],"prefix":"10.1007","volume":"50","author":[{"given":"Olaf","family":"Beyersdorff","sequence":"first","affiliation":[]},{"given":"Arne","family":"Meier","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"M\u00fcller","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Thomas","sequence":"additional","affiliation":[]},{"given":"Heribert","family":"Vollmer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,7,3]]},"reference":[{"issue":"2","key":"245_CR1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1093\/logcom\/6.2.205","volume":"6","author":"G. Amati","year":"1996","unstructured":"Amati G., Aiello L.C., Gabbay D.M., Pirri F.: A proof theoretical approach to default reasoning I: tableaux for default logic. J. Log. Comput. 6(2), 205\u2013231 (1996)","journal-title":"J. Log. Comput."},{"issue":"4","key":"245_CR2","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1145\/344588.344602","volume":"31","author":"G. Antoniou","year":"1999","unstructured":"Antoniou G.: A tutorial on default logics. ACM Comput. Surv. 31(4), 337\u2013359 (1999)","journal-title":"ACM Comput. Surv."},{"key":"245_CR3","doi-asserted-by":"crossref","unstructured":"Beyersdorff, O., Meier, A., M\u00fcller, S., Thomas, M., Vollmer, H.: Proof complexity of propositional default logic. In: Proceedings of 13th International Conference on Theory and Applications of Satisfiability Testing, vol. 6175 of Lecture Notes in Computer Science, pp. 30\u201343. Springer, Berlin, Heidelberg (2010)","DOI":"10.1007\/978-3-642-14186-7_5"},{"key":"245_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":"245_CR5","doi-asserted-by":"crossref","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. Log. 3(2), 226\u2013278 (2002)","journal-title":"ACM Trans. Comput. Log."},{"key":"245_CR6","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/978-1-4612-2566-9_3","volume-title":"Feasible Mathematics II","author":"M.L. Bonet","year":"1995","unstructured":"Bonet M.L., Buss S.R., Pitassi T.: Are there hard examples for Frege systems?. In: Clote, P., Remmel, J. (eds) Feasible Mathematics II, pp. 30\u201356. Birkh\u00e4user, Basel (Boston\/Stuttgart) (1995)"},{"issue":"6","key":"245_CR7","doi-asserted-by":"crossref","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 J. Comput. 29(6), 1939\u20131967 (2000)","journal-title":"SIAM J. Comput."},{"issue":"2\/3&4","key":"245_CR8","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0743-1066(93)90029-G","volume":"17","author":"M. Cadoli","year":"1993","unstructured":"Cadoli M., Schaerf M.: A survey of complexity results for nonmonotonic logics. J. Log. Program. 17(2\/3&4), 127\u2013160 (1993)","journal-title":"J. Log. Program."},{"issue":"1","key":"245_CR9","doi-asserted-by":"crossref","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. J. Symb. Log. 44(1), 36\u201350 (1979)","journal-title":"J. Symb. Log."},{"key":"245_CR10","doi-asserted-by":"crossref","unstructured":"Dix, J., Furbach, U., Niemel\u00e4, I.: Nonmonotonic reasoning: towards efficient calculi and implementations. In: Handbook of Automated Reasoning, pp. 1241\u20131354. Elsevier and MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50021-7"},{"issue":"3","key":"245_CR11","doi-asserted-by":"crossref","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 Trans. Comput. Log. 2(3), 340\u2013387 (2001)","journal-title":"ACM Trans. Comput. Log."},{"key":"245_CR12","doi-asserted-by":"crossref","unstructured":"Gabbay, D.: Theoretical foundations of non-monotonic reasoning in expert systems. In: Logics and Models of Concurrent Systems, pp. 439\u2013457. Springer, Berlin, Heidelberg (1985)","DOI":"10.1007\/978-3-642-82453-1_15"},{"key":"245_CR13","first-page":"68","volume":"39","author":"G. Gentzen","year":"1935","unstructured":"Gentzen G.: Untersuchungen \u00fcber das logische Schlie\u00dfen. Mathematische Zeitschrift 39, 68\u2013131 (1935)","journal-title":"Mathematische Zeitschrift"},{"issue":"3","key":"245_CR14","doi-asserted-by":"crossref","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. 2(3), 397\u2013425 (1992)","journal-title":"J. Log. Comput."},{"issue":"2\u20133","key":"245_CR15","doi-asserted-by":"crossref","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. Ann. Pure Appl. Log. 157(2\u20133), 194\u2013205 (2009)","journal-title":"Ann. Pure Appl. Log."},{"key":"245_CR16","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1016\/j.apal.2006.04.001","volume":"142","author":"E. Je\u0159\u00e1bek","year":"2006","unstructured":"Je\u0159\u00e1bek E.: Frege systems for extensible modal logics. Ann. Pure Appl. Log. 142, 366\u2013379 (2006)","journal-title":"Ann. Pure Appl. Log."},{"issue":"1\u20132","key":"245_CR17","doi-asserted-by":"crossref","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. Ann. Pure Appl. Log. 159(1\u20132), 1\u201348 (2009)","journal-title":"Ann. Pure Appl. Log."},{"key":"245_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511529948","volume-title":"Bounded Arithmetic, Propositional Logic, and Complexity Theory, vol. 60 of Encyclopedia of Mathematics and Its Applications","author":"J. Kraj\u00ed\u010dek","year":"1995","unstructured":"Kraj\u00ed\u010dek J.: Bounded Arithmetic, Propositional Logic, and Complexity Theory, vol. 60 of Encyclopedia of Mathematics and Its Applications. Cambridge University Press, Cambridge (1995)"},{"issue":"1\u20132","key":"245_CR19","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0004-3702(90)90101-5","volume":"44","author":"S. Kraus","year":"1990","unstructured":"Kraus S., Lehmann D.J., Magidor M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artif. Intell. 44(1\u20132), 167\u2013207 (1990)","journal-title":"Artif. Intell."},{"key":"245_CR20","doi-asserted-by":"crossref","unstructured":"Makinson, D.: General theory of cumulative inference. In: Proceedings of 2nd International Workshop on Non-Monotonic Reasoning, pp. 1\u201318. Springer, Berlin, Heidelberg (1989)","DOI":"10.1007\/3-540-50701-9_16"},{"key":"245_CR21","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, Berlin, Heidelberg (1993)"},{"key":"245_CR22","doi-asserted-by":"crossref","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. Artif. Intell. 13, 81\u2013132 (1980)","journal-title":"Artif. Intell."},{"issue":"2","key":"245_CR23","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF00881957","volume":"13","author":"V. Risch","year":"1994","unstructured":"Risch V., Schwind C.: Tableaux-based characterization and theorem proving for default logic. J. Autom. Reason. 13(2), 223\u2013242 (1994)","journal-title":"J. Autom. Reason."},{"key":"245_CR24","doi-asserted-by":"crossref","unstructured":"Tiomkin, M.L.: Proving unprovability. In: Proceedings of 3rd Annual Symposium on Logic in Computer Science, pp. 22\u201326 (1988)","DOI":"10.1109\/LICS.1988.5097"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-011-0245-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-011-0245-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-011-0245-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T17:07:04Z","timestamp":1560359224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-011-0245-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,3]]},"references-count":24,"journal-issue":{"issue":"7-8","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["245"],"URL":"https:\/\/doi.org\/10.1007\/s00153-011-0245-8","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,3]]}}}