{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T05:06:07Z","timestamp":1777957567001,"version":"3.51.4"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030802226","type":"print"},{"value":"9783030802233","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-80223-3_8","type":"book-chapter","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T14:13:49Z","timestamp":1625148829000},"page":"98-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hardness and Optimality in QBF Proof Systems Modulo NP"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0226-2832","authenticated-orcid":false,"given":"Leroy","family":"Chew","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,2]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity - A Modern Approach. Cambridge University Press, Cambridge (2009)","DOI":"10.1017\/CBO9780511804090"},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10703-012-0152-6","volume":"41","author":"V Balabanov","year":"2012","unstructured":"Balabanov, V., Jiang, J.H.R.: Unified QBF certification and its applications. Formal Methods Syst. Des. 41(1), 45\u201365 (2012)","journal-title":"Formal Methods Syst. Des."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1137\/0221068","volume":"21","author":"S Bellatoni","year":"1992","unstructured":"Bellatoni, S., Pitassi, T., Urquhart, A.: Approximation of small-depth Frege proofs. SIAM J. Comput. 21, 1161\u20131179 (1992)","journal-title":"SIAM J. Comput."},{"key":"8_CR4","unstructured":"Beyersdorff, O., Blinkhorn, J., Hinde, L.: Size, cost, and capacity: a semantic technique for hard random QBFs. CoRR abs\/1712.03626 (2017). http:\/\/arxiv.org\/abs\/1712.03626"},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Beyersdorff, O., Bonacina, I., Chew, L., Pich, J.: Frege systems for quantified boolean logic. J. ACM 67(2), (2020). https:\/\/doi.org\/10.1145\/3381881","DOI":"10.1145\/3381881"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Beyersdorff, O., Chew, L., Janota, M.: New resolution-based QBF calculi and their proof complexity. ACM Trans. Comput. Theory 11(4), 26:1\u201326:42 (2019). https:\/\/doi.org\/10.1145\/3352155","DOI":"10.1145\/3352155"},{"key":"8_CR7","unstructured":"Beyersdorff, O., Chew, L., Janota, M.: Extension variables in QBF resolution. In: Beyond, N.P.: Papers from the 2016 AAAI Workshop (2016). http:\/\/www.aaai.org\/ocs\/index.php\/WS\/AAAIW16\/paper\/view\/12612"},{"key":"8_CR8","unstructured":"Beyersdorff, O., Hinde, L., Pich, J.: Reasons for hardness in QBF proof systems. Electron. Colloquium Comput. Complexity (ECCC) 24, 44 (2017). https:\/\/eccc.weizmann.ac.il\/report\/2017\/044"},{"key":"8_CR9","unstructured":"Blinkhorn, J.L.: Quantified Boolean Formulas: Proof Complexity and Models of Solving. Ph.D. thesis, University of Leeds (2019)"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Chen, H.: Proof complexity modulo the polynomial hierarchy: Understanding alternation as a source of hardness. In: ICALP, pp. 94:1\u201394:14 (2016)","DOI":"10.1145\/3087534"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-030-51074-9_5","volume-title":"Automated Reasoning","author":"L Chew","year":"2020","unstructured":"Chew, L., Clymo, J.: How QBF expansion makes strategy extraction hard. In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020. LNCS (LNAI), vol. 12166, pp. 66\u201382. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51074-9_5"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"36","DOI":"10.2307\/2273702","volume":"44","author":"SA Cook","year":"1979","unstructured":"Cook, S.A., Reckhow, R.A.: The relative efficiency of propositional proof systems. J. Symbolic Logic 44(1), 36\u201350 (1979)","journal-title":"J. Symbolic Logic"},{"key":"8_CR13","unstructured":"Feldman, A., Kleer, J., Matei, I.: Design space exploration as quantified satisfaction (05 2019)"},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF01744431","volume":"17","author":"ML Furst","year":"1984","unstructured":"Furst, M.L., Saxe, J.B., Sipser, M.: Parity, circuits, and the polynomial-time hierarchy. Math. Syst. Theory 17(1), 13\u201327 (1984)","journal-title":"Math. Syst. Theory"},{"key":"8_CR15","unstructured":"Goultiaeva, A., Van Gelder, A., Bacchus, F.: A uniform approach for generating proofs and strategies for both true and false QBF formulas. In: Walsh, T. (ed.) International Joint Conference on Artificial Intelligence IJCAI, pp. 546\u2013553. IJCAI\/AAAI (2011)"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","volume":"39","author":"A Haken","year":"1985","unstructured":"Haken, A.: The intractability of resolution. Theor. Comput. Sci. 39, 297\u2013308 (1985)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0020-0190(87)90053-6","volume":"26","author":"J H\u00e5stad","year":"1987","unstructured":"H\u00e5stad, J.: One-way permutations in NC$$^0$$. Inf. Process. Lett. 26(3), 153\u2013155 (1987)","journal-title":"Inf. Process. Lett."},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Heule, M., Seidl, M., Biere, A.: A unified proof system for QBF preprocessing. In: 7th International Joint Conference on Automated Reasoning (IJCAR), pp. 91\u2013106 (2014)","DOI":"10.1007\/978-3-319-08587-6_7"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-31612-8_10","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"M Janota","year":"2012","unstructured":"Janota, M., Klieber, W., Marques-Silva, J., Clarke, E.: Solving QBF with counterexample guided refinement. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 114\u2013128. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31612-8_10"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2015.01.048","volume":"577","author":"M Janota","year":"2015","unstructured":"Janota, M., Marques-Silva, J.: Expansion-based QBF solving versus Q-resolution. Theor. Comput. Sci. 577, 25\u201342 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.apal.2003.12.003","volume":"129","author":"E Je\u0159\u00e1bek","year":"2004","unstructured":"Je\u0159\u00e1bek, E.: Dual weak pigeonhole principle, Boolean complexity, and derandomization. Ann. Pure Appl. Logic 129, 1\u201337 (2004)","journal-title":"Ann. Pure Appl. Logic"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-540-72788-0_21","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"T Jussila","year":"2007","unstructured":"Jussila, T., Biere, A., Sinz, C., Kr\u00f6ning, D., Wintersteiger, C.M.: A first step towards a unified proof checker for QBF. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 201\u2013214. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72788-0_21"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-319-66263-3_18","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2017","author":"B Kiesl","year":"2017","unstructured":"Kiesl, B., Heule, M.J.H., Seidl, M.: A little blocked literal goes a long way. In: Gaspers, S., Walsh, T. (eds.) SAT 2017. LNCS, vol. 10491, pp. 281\u2013297. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66263-3_18"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-030-24258-9_13","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2019","author":"B Kiesl","year":"2019","unstructured":"Kiesl, B., Seidl, M.: QRAT polynomially simulates $$\\forall \\text{-Exp+Res }$$. In: Janota, M., Lynce, I. (eds.) SAT 2019. LNCS, vol. 11628, pp. 193\u2013202. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24258-9_13"},{"key":"8_CR25","unstructured":"Kleine B\u00fcning, H., Bubeck, U.: Theory of quantified Boolean formulas. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 735\u2013760. IOS Press (2009)"},{"issue":"1","key":"8_CR26","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1006\/inco.1995.1025","volume":"117","author":"H Kleine B\u00fcning","year":"1995","unstructured":"Kleine B\u00fcning, H., Karpinski, M., Fl\u00f6gel, A.: Resolution for quantified Boolean formulas. Inf. Comput. 117(1), 12\u201318 (1995)","journal-title":"Inf. Comput."},{"key":"8_CR27","volume-title":"Bounded Arithmetic, Propositional Logic, and Complexity Theory, 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, Encyclopedia of Mathematics and Its Applications, vol. 60. Cambridge University Press, Cambridge (1995)"},{"key":"8_CR28","unstructured":"Lonsing, F.: Dependency Schemes and Search-Based QBF Solving: Theory and Practice. Ph.D. thesis, Informatik, Johannes Kepler University Linz (2012)"},{"issue":"2\u20133","key":"8_CR29","first-page":"71","volume":"7","author":"F Lonsing","year":"2010","unstructured":"Lonsing, F., Biere, A.: DepQBF: a dependency-aware QBF solver. JSAT 7(2\u20133), 71\u201376 (2010)","journal-title":"JSAT"},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Messner, J., Tor\u00e1n, J.: Optimal proof systems for propositional logic and complete sets. Technical Report, TR97-026, Electronic Colloquium on Computational Complexity, a revised version appears at STACS\u201998 (1997)","DOI":"10.1007\/BFb0028583"},{"key":"8_CR31","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Boston (1994)"},{"key":"8_CR32","unstructured":"Slivovsky, F.: Structure in# SAT and QBF. Ph.D. thesis (2015)"},{"key":"8_CR33","first-page":"234","volume":"8","author":"GS Tseitin","year":"1968","unstructured":"Tseitin, G.S.: On the complexity of proof in prepositional calculus. Zapiski Nauchnykh Seminarov POMI 8, 234\u2013259 (1968)","journal-title":"Zapiski Nauchnykh Seminarov POMI"},{"key":"8_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/978-3-642-33558-7_47","volume-title":"Principles and Practice of Constraint Programming","author":"A Gelder","year":"2012","unstructured":"Gelder, A.: Contributions to the theory of practical quantified Boolean formula solving. In: Milano, M. (ed.) CP 2012. LNCS, pp. 647\u2013663. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33558-7_47"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80223-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T09:39:17Z","timestamp":1672652357000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80223-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030802226","9783030802233"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80223-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Satisfiability Testing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sat2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iiia.csic.es\/sat2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}