{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T11:39:15Z","timestamp":1790509155634,"version":"4.1.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030518240","type":"print"},{"value":"9783030518257","type":"electronic"}],"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_21","type":"book-chapter","created":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T23:00:13Z","timestamp":1593558013000},"page":"295-311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["MaxSAT Resolution and Subcube Sums"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Filmus","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meena","family":"Mahajan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gaurav","family":"Sood","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marc","family":"Vinyals","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,6,26]]},"reference":[{"key":"21_CR1","unstructured":"Atserias, A., Hakoniemi, T.: Size-degree trade-offs for sums-of-squares and Positivstellensatz proofs. In: Proceedings of the 34th Computational Complexity Conference (CCC 2019), pp. 24:1\u201324:20, July 2019"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-24258-9_1","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2019","author":"A Atserias","year":"2019","unstructured":"Atserias, A., Lauria, M.: Circular (yet sound) proofs. In: Janota, M., Lynce, I. (eds.) SAT 2019. LNCS, vol. 11628, pp. 1\u201318. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24258-9_1"},{"issue":"4","key":"21_CR3","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s00493-004-0036-5","volume":"24","author":"E Ben-Sasson","year":"2004","unstructured":"Ben-Sasson, E., Impagliazzo, R., Wigderson, A.: Near optimal separation of tree-like and general resolution. Combinatorica 24(4), 585\u2013603 (2004)","journal-title":"Combinatorica"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Wigderson, A.: Short proofs are narrow\u2013resolution made simple. J. ACM 48(2), 149\u2013169 (2001). Preliminary version in STOC 1999","DOI":"10.1145\/375827.375835"},{"key":"21_CR5","unstructured":"Blake, A.: Canonical expressions in boolean algebra. Ph.D. thesis, University of Chicago (1937)"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Bonet, M.L., Buss, S., Ignatiev, A., Marques-Silva, J., Morgado, A.: MaxSAT resolution with the dual rail encoding. In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence, (AAAI 2018), pp. 6565\u20136572 (2018)","DOI":"10.1609\/aaai.v32i1.12204"},{"issue":"8","key":"21_CR7","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/j.artint.2007.03.001","volume":"171","author":"ML Bonet","year":"2007","unstructured":"Bonet, M.L., Levy, J., Many\u00e0, F.: Resolution for Max-SAT. Artif. Intell. 171(8), 606\u2013618 (2007)","journal-title":"Artif. Intell."},{"key":"21_CR8","unstructured":"Cook, S.A.: An observation on time-storage trade off. J. Comput. Syst. Sci. 9(3), 308\u2013316 (1974). Preliminary version in STOC 1973"},{"issue":"1\u20132","key":"21_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0400000086","volume":"14","author":"N Fleming","year":"2019","unstructured":"Fleming, N., Kothari, P., Pitassi, T.: Semialgebraic proofs and efficient algorithm design. Found. Trends Theor. Comput. Sci. 14(1\u20132), 1\u2013221 (2019)","journal-title":"Found. Trends Theor. Comput. Sci."},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1137\/16M109884X","volume":"47","author":"M G\u00f6\u00f6s","year":"2018","unstructured":"G\u00f6\u00f6s, M., Jain, R., Watson, T.: Extension complexity of independent set polytopes. SIAM J. Comput. 47(1), 241\u2013269 (2018)","journal-title":"SIAM J. Comput."},{"key":"21_CR11","unstructured":"G\u00f6\u00f6s, M., Lovett, S., Meka, R., Watson, T., Zuckerman, D.: Rectangles are nonnegative juntas. SIAM J. Comput. 45(5), 1835\u20131869 (2016). Preliminary version in STOC 2015"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-319-66263-3_11","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2017","author":"A Ignatiev","year":"2017","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: On tackling the limits of resolution in SAT solving. In: Gaspers, S., Walsh, T. (eds.) SAT 2017. LNCS, vol. 10491, pp. 164\u2013183. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66263-3_11"},{"key":"21_CR13","unstructured":"Iwama, K., Miyano, E.: Intractability of read-once resolution. In: Structure in Complexity Theory Conference, pp. 29\u201336. IEEE Computer Society (1995)"},{"issue":"2\u20133","key":"21_CR14","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.artint.2007.05.006","volume":"172","author":"J Larrosa","year":"2008","unstructured":"Larrosa, J., Heras, F., de Givry, S.: A logical approach to efficient Max-SAT solving. Artif. Intell. 172(2\u20133), 204\u2013233 (2008)","journal-title":"Artif. Intell."},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Larrosa, J., Rollon, E.: Augmenting the power of (partial) MaxSAT resolution with extension. In: Proceedings of the 34th AAAI Conference on Artificial Intelligence (2020)","DOI":"10.1609\/aaai.v34i02.5516"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Larrosa, J., Rollon, E.: Towards a better understanding of (partial weighted) MaxSAT proof systems. Technical report. 2003.02718. arXiv.org (2020)","DOI":"10.1007\/978-3-030-51825-7_16"},{"key":"21_CR17","unstructured":"Loff, B., Mukhopadhyay, S.: Lifting theorems for equality. In: Proceedings of the 36th Symposium on Theoretical Aspects of Computer Science (STACS 2019), pp. 50:1\u201350:19, March 2019"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-319-65340-2_56","volume-title":"Progress in Artificial Intelligence","author":"J Marques-Silva","year":"2017","unstructured":"Marques-Silva, J., Ignatiev, A., Morgado, A.: Horn maximum satisfiability: reductions, algorithms and applications. In: Oliveira, E., Gama, J., Vale, Z., Lopes Cardoso, H. (eds.) EPIA 2017. LNCS (LNAI), vol. 10423, pp. 681\u2013694. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-65340-2_56"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-319-09284-3_10","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"M Mik\u0161a","year":"2014","unstructured":"Mik\u0161a, M., Nordstr\u00f6m, J.: Long proofs of (seemingly) simple formulas. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 121\u2013137. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09284-3_10"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Narodytska, N., Bacchus, F.: Maximum satisfiability using core-guided MaxSAT resolution. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence, pp. 2717\u20132723 (2014)","DOI":"10.1609\/aaai.v28i1.9124"},{"key":"21_CR21","unstructured":"Pudl\u00e1k, P., Impagliazzo, R.: A lower bound for DLL algorithms for $$k$$-SAT (preliminary version). In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), pp. 128\u2013136, January 2000"},{"key":"21_CR22","doi-asserted-by":"publisher","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, 23\u201341 (1965)","journal-title":"J. ACM"},{"key":"21_CR23","doi-asserted-by":"publisher","first-page":"1.2:1","DOI":"10.1145\/1671970.1671972","volume":"15","author":"I Spence","year":"2010","unstructured":"Spence, I.: sgen1: a generator of small but difficult satisfiability benchmarks. J. Exp. Algorithmics 15, 1.2:1\u20131.2:15 (2010)","journal-title":"J. Exp. Algorithmics"},{"issue":"1","key":"21_CR24","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/7531.8928","volume":"34","author":"A Urquhart","year":"1987","unstructured":"Urquhart, A.: Hard examples for resolution. J. ACM 34(1), 209\u2013219 (1987)","journal-title":"J. ACM"},{"key":"21_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-642-14186-7_37","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"A Van Gelder","year":"2010","unstructured":"Van Gelder, A., Spence, I.: Zero-one designs produce small hard SAT instances. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 388\u2013397. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14186-7_37"}],"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_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T11:43:50Z","timestamp":1667216630000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51825-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030518240","9783030518257"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51825-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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"}]}}