{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:45:11Z","timestamp":1743000311846,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030518240"},{"type":"electronic","value":"9783030518257"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-51825-7_28","type":"book-chapter","created":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T23:00:13Z","timestamp":1593558013000},"page":"394-411","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Strong (D)QBF Dependency Schemes via\u00a0Tautology-Free Resolution Paths"],"prefix":"10.1007","author":[{"given":"Olaf","family":"Beyersdorff","sequence":"first","affiliation":[]},{"given":"Joshua","family":"Blinkhorn","sequence":"additional","affiliation":[]},{"given":"Tom\u00e1\u0161","family":"Peitl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,26]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1016\/S0898-1221(00)00333-3","volume":"41","author":"S Azhar","year":"2001","unstructured":"Azhar, S., Peterson, G., Reif, J.: Lower bounds for multiplayer non-cooperative games of incomplete information. J. Comput. Math. Appl. 41, 957\u2013992 (2001)","journal-title":"J. Comput. Math. Appl."},{"issue":"1","key":"28_CR2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10703-012-0152-6","volume":"41","author":"V Balabanov","year":"2012","unstructured":"Balabanov, V., Jiang, J.R.: Unified QBF certification and its applications. Formal Methods Syst. Des. 41(1), 45\u201365 (2012)","journal-title":"Formal Methods Syst. Des."},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-319-09284-3_12","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"V Balabanov","year":"2014","unstructured":"Balabanov, V., Widl, M., Jiang, J.-H.R.: QBF resolution systems and their proof complexities. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 154\u2013169. Springer, Cham (2014). \n                  https:\/\/doi.org\/10.1007\/978-3-319-09284-3_12"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-319-44953-1_7","volume-title":"Principles and Practice of Constraint Programming","author":"O Beyersdorff","year":"2016","unstructured":"Beyersdorff, O., Blinkhorn, J.: Dependency schemes in qbf calculi: semantics and soundness. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 96\u2013112. Springer, Cham (2016). \n                  https:\/\/doi.org\/10.1007\/978-3-319-44953-1_7"},{"unstructured":"Beyersdorff, O., Blinkhorn, J.: Genuine lower bounds for QBF expansion. In: Niedermeier, R., Vall\u00e9e, B. (eds.) International Symposium on Theoretical Aspects of Computer Science (STACS). Leibniz International Proceedings in Informatics (LIPIcs), vol. 96, pp. 12:1\u201312:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)","key":"28_CR5"},{"issue":"2","key":"28_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3355995","volume":"21","author":"O Beyersdorff","year":"2019","unstructured":"Beyersdorff, O., Blinkhorn, J.: Dynamic QBF dependencies in reduction and expansion. ACM Trans. Comput. Logic 21(2), 1\u201327 (2019)","journal-title":"ACM Trans. Comput. Logic"},{"issue":"3","key":"28_CR7","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s10817-018-9482-4","volume":"63","author":"O Beyersdorff","year":"2019","unstructured":"Beyersdorff, O., Blinkhorn, J., Chew, L., Schmidt, R.A., Suda, M.: Reinterpreting dependency schemes: soundness meets incompleteness in DQBF. J. Autom. Reason. 63(3), 597\u2013623 (2019)","journal-title":"J. Autom. Reason."},{"unstructured":"Beyersdorff, O., Blinkhorn, J., Hinde, L.: Size, cost, and capacity: a semantic technique for hard random QBFs. Logical Methods Comput. Sci. 15(1), (2019)","key":"28_CR8"},{"doi-asserted-by":"crossref","unstructured":"Beyersdorff, O., Bonacina, I., Chew, L.: Lower bounds: from circuits to QBF proof systems. In: Sudan, M. (ed.) ACM Conference on Innovations in Theoretical Computer Science (ITCS), pp. 249\u2013260. ACM (2016)","key":"28_CR9","DOI":"10.1145\/2840728.2840740"},{"issue":"4","key":"28_CR10","doi-asserted-by":"crossref","first-page":"26:1","DOI":"10.1145\/3352155","volume":"11","author":"O Beyersdorff","year":"2019","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)","journal-title":"ACM Trans. Comput. Theory"},{"doi-asserted-by":"crossref","unstructured":"Beyersdorff, O., Chew, L., Schmidt, R.A., Suda, M.: Lifting QBF resolution calculito DQBF. In: Creignou and Berre [16], pp. 490-499","key":"28_CR11","DOI":"10.1007\/978-3-319-40970-2_30"},{"issue":"2","key":"28_CR12","doi-asserted-by":"crossref","first-page":"10:1","DOI":"10.1145\/3378665","volume":"12","author":"O Beyersdorff","year":"2020","unstructured":"Beyersdorff, O., Hinde, L., Pich, J.: Reasons for hardness in QBF proof systems. ACM Trans. Comput. Theory 12(2), 10:1\u201310:27 (2020)","journal-title":"ACM Trans. Comput. Theory"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-319-66263-3_17","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2017","author":"J Blinkhorn","year":"2017","unstructured":"Blinkhorn, J., Beyersdorff, O.: Shortening QBF proofs with dependency schemes. In: Gaspers, S., Walsh, T. (eds.) SAT 2017. LNCS, vol. 10491, pp. 263\u2013280. Springer, Cham (2017). \n                  https:\/\/doi.org\/10.1007\/978-3-319-66263-3_17"},{"issue":"3","key":"28_CR14","first-page":"15:1","volume":"9","author":"H Chen","year":"2017","unstructured":"Chen, H.: Proof complexity modulo the polynomial hierarchy: Understanding alternation as a source of hardness. ACM Trans. Comput. Theory 9(3), 15:1\u201315:20 (2017)","journal-title":"ACM Trans. Comput. Theory"},{"issue":"1","key":"28_CR15","doi-asserted-by":"crossref","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. Symbol. Logic 44(1), 36\u201350 (1979)","journal-title":"J. Symbol. Logic"},{"doi-asserted-by":"publisher","unstructured":"Creignou, N., Le Berre, D. (eds.) International Conference on Theory and Practice of Satisfiability Testing (SAT). LNCS, vol. 9710. Springer, Cham (2016). \n                  https:\/\/doi.org\/10.1007\/978-3-319-40970-2","key":"28_CR16","DOI":"10.1007\/978-3-319-40970-2"},{"issue":"1","key":"28_CR17","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10472-016-9501-2","volume":"80","author":"U Egly","year":"2017","unstructured":"Egly, U., Kronegger, M., Lonsing, F., Pfandler, A.: Conformant planning as a case study of incremental QBF solving. Ann. Math. Artif. Intell. 80(1), 21\u201345 (2017)","journal-title":"Ann. Math. Artif. Intell."},{"unstructured":"Henkin, L.: Some remarks on infinitely long formulas. Infinitistic Methods, pp. 167\u2013183 (1961)","key":"28_CR18"},{"doi-asserted-by":"publisher","unstructured":"Hooker, J. (ed.): International Conference on Principles and Practice of Constraint Programming (CP). LNCS, vol. 11008. Springer, Cham (2018). \n                  https:\/\/doi.org\/10.1007\/978-3-319-98334-9","key":"28_CR19","DOI":"10.1007\/978-3-319-98334-9"},{"doi-asserted-by":"crossref","unstructured":"Hoos, H.H., Peitl, T., Slivovsky, F., Szeider, S.: portfolio-based algorithm selection for circuit QBFs. In: Hooker [19], pp. 195\u2013209","key":"28_CR20","DOI":"10.1007\/978-3-319-98334-9_13"},{"key":"28_CR21","doi-asserted-by":"crossref","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."},{"issue":"1","key":"28_CR22","doi-asserted-by":"crossref","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."},{"unstructured":"Kontchakov, R., et al.: Minimal module extraction from DL-lite ontologies using QBF solvers. In: Boutilier, C. (ed.) International Joint Conference on Artificial Intelligence (IJCAI), pp. 836\u2013841. AAAI Press (2009)","key":"28_CR23"},{"key":"28_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-319-63046-5_23","volume-title":"Automated Deduction \u2013 CADE 26","author":"F Lonsing","year":"2017","unstructured":"Lonsing, F., Egly, U.: DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL. In: de Moura, L. (ed.) CADE 2017. LNCS (LNAI), vol. 10395, pp. 371\u2013384. Springer, Cham (2017). \n                  https:\/\/doi.org\/10.1007\/978-3-319-63046-5_23"},{"doi-asserted-by":"crossref","unstructured":"Lonsing, F., Egly, U.: Evaluating QBF solvers: Quantifier alternations matter. In: Hooker [19], pp. 276\u2013294","key":"28_CR25","DOI":"10.1007\/978-3-319-98334-9_19"},{"issue":"7","key":"28_CR26","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1109\/TC.2010.74","volume":"59","author":"H Mangassarian","year":"2010","unstructured":"Mangassarian, H., Veneris, A.G., Benedetti, M.: Robust QBF encodings for sequential circuits with applications to verification, debug, and test. IEEE Trans. Comput. 59(7), 981\u2013994 (2010)","journal-title":"IEEE Trans. Comput."},{"doi-asserted-by":"crossref","unstructured":"Peitl, T., Slivovsky, F., Szeider, S.: Combining resolution-path dependencies with dependency learning. In: International Conference on Theory and Practice of Satisfiability Testing (SAT), pp. 306\u2013318 (2019)","key":"28_CR27","DOI":"10.1007\/978-3-030-24258-9_22"},{"key":"28_CR28","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1613\/jair.1.11529","volume":"65","author":"T Peitl","year":"2019","unstructured":"Peitl, T., Slivovsky, F., Szeider, S.: Dependency learning for QBF. J. Artif. Intell. Res. 65, 181\u2013208 (2019)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"28_CR29","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10817-018-9467-3","volume":"63","author":"T Peitl","year":"2019","unstructured":"Peitl, T., Slivovsky, F., Szeider, S.: Long-distance Q-resolution with dependency schemes. J. Autom. Reason. 63(1), 127\u2013155 (2019)","journal-title":"J. Autom. Reason."},{"key":"28_CR30","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/j.artint.2019.04.002","volume":"274","author":"L Pulina","year":"2019","unstructured":"Pulina, L., Seidl, M.: The 2016 and 2017 QBF solvers evaluations (QBFEVAL\u201916 and QBFEVAL\u201917). Artif. Intell. 274, 224\u2013248 (2019)","journal-title":"Artif. Intell."},{"issue":"1","key":"28_CR31","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"JA Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. ACM 12(1), 23\u201341 (1965)","journal-title":"J. ACM"},{"issue":"1","key":"28_CR32","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10817-008-9114-5","volume":"42","author":"M Samer","year":"2009","unstructured":"Samer, M., Szeider, S.: Backdoor sets of quantified Boolean formulas. J. Autom. Reason. 42(1), 77\u201397 (2009)","journal-title":"J. Autom. Reason."},{"key":"28_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-94144-8_1","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2018","author":"C Scholl","year":"2018","unstructured":"Scholl, C., Wimmer, R.: Dependency quantified boolean formulas: an overview of solution methods and applications. In: Beyersdorff, O., Wintersteiger, C.M. (eds.) SAT 2018. LNCS, vol. 10929, pp. 3\u201316. Springer, Cham (2018). \n                  https:\/\/doi.org\/10.1007\/978-3-319-94144-8_1"},{"unstructured":"Slivovsky, F.: Structure in $$\\#$$SAT and QBF. Ph.D. thesis, Vienna University of Technology (2015)","key":"28_CR34"},{"key":"28_CR35","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.tcs.2015.10.020","volume":"612","author":"F Slivovsky","year":"2016","unstructured":"Slivovsky, F., Szeider, S.: Soundness of Q-resolution with dependency schemes. Theor. Comput. Sci. 612, 83\u2013101 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"28_CR36","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/2578043","volume":"57","author":"MY Vardi","year":"2014","unstructured":"Vardi, M.Y.: Boolean satisfiability: theory and engineering. Commun. ACM 57(3), 5 (2014)","journal-title":"Commun. ACM"},{"doi-asserted-by":"crossref","unstructured":"Wimmer, R., Scholl, C., Wimmer, K., Becker, B.: Dependency schemes for DQBF. In: Creignou and Berre [16], pp. 473\u2013489","key":"28_CR37","DOI":"10.1007\/978-3-319-40970-2_29"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2020"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51825-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,10]],"date-time":"2020-08-10T15:09:05Z","timestamp":1597072145000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51825-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030518240","9783030518257"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51825-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"26 June 2020","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":"Alghero","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sat2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sat2020.idea-researchlab.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}