{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T04:02:12Z","timestamp":1751774532460,"version":"3.41.0"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319941431"},{"type":"electronic","value":"9783319941448"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-94144-8_5","type":"book-chapter","created":{"date-parts":[[2018,6,25]],"date-time":"2018-06-25T08:36:02Z","timestamp":1529915762000},"page":"75-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers"],"prefix":"10.1007","author":[{"given":"Jan","family":"Elffers","sequence":"first","affiliation":[]},{"given":"Jes\u00fas","family":"Gir\u00e1ldez-Cru","sequence":"additional","affiliation":[]},{"given":"Jakob","family":"Nordstr\u00f6m","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Vinyals","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,26]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Barth, P.: Linear $$0$$-$$1$$ inequalities and extended clauses. Technical report MPI-I-94-216, Max-Planck-Institut f\u00fcr Informatik, April 1994. Preliminary version in LPAR 1993","DOI":"10.1007\/978-3-642-46955-8_7"},{"key":"5_CR2","unstructured":"Barth, P.: A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization. Technical report MPI-I-95-2-003, Max-Planck-Institut f\u00fcr Informatik, January 1995"},{"key":"5_CR3","unstructured":"Bayardo Jr., R.J., Schrag, R.: Using CSP look-back techniques to solve real-world SAT instances. In: Proceedings of the 14th National Conference on Artificial Intelligence (AAAI 1997), pp. 203\u2013208, July 1997"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Wigderson, A.: Short proofs are narrow\u2014resolution made simple. J. ACM 48(2), 149\u2013169 (2001). Preliminary version in STOC 1999","DOI":"10.1145\/375827.375835"},{"issue":"1\u20133","key":"5_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","volume":"123","author":"E Boros","year":"2002","unstructured":"Boros, E., Hammer, P.L.: Pseudo-Boolean optimization. Discrete Appl. Math. 123(1\u20133), 155\u2013225 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"5_CR6","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/TCAD.2004.842808","volume":"24","author":"D Chai","year":"2005","unstructured":"Chai, D., Kuehlmann, A.: A fast pseudo-Boolean constraint solver. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 24(3), 305\u2013317 (2005). Preliminary version in DAC 2003","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circ. Syst."},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V.: Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. 4(1), 305\u2013337 (1973)","journal-title":"Discrete Math."},{"key":"5_CR8","unstructured":"CNFgen: Combinatorial benchmarks for SAT solvers. https:\/\/github.com\/MassimoLauria\/cnfgen"},{"issue":"1","key":"5_CR9","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0166-218X(87)90039-4","volume":"18","author":"W Cook","year":"1987","unstructured":"Cook, W., Coullard, C.R., Tur\u00e1n, G.: On the complexity of cutting-plane proofs. Discrete Appl. Math. 18(1), 25\u201338 (1987)","journal-title":"Discrete Appl. Math."},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1613\/jair.1656","volume":"23","author":"HE Dixon","year":"2005","unstructured":"Dixon, H.E., Ginsberg, M.L., Hofer, D.K., Luks, E.M., Parkes, A.J.: Generalizing Boolean satisfiability III: implementation. J. Artif. Intell. Res. 23, 441\u2013531 (2005)","journal-title":"J. Artif. Intell. Res."},{"issue":"1\u20134","key":"5_CR11","first-page":"1","volume":"2","author":"N E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating pseudo-Boolean constraints into SAT. J. Satisf. Boolean Model. Comput. 2(1\u20134), 1\u201326 (2006)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"5_CR12","unstructured":"Elffers, J.: cdcl-cuttingplanes: a conflict-driven pseudo-Boolean solver (2016). Submitted to the Pseudo-Boolean Competition 2016"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Elffers, J., Nordstr\u00f6m, J.: Divide and conquer: towards faster pseudo-Boolean solving. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI-ECAI 2018), July 2018 (to appear)","DOI":"10.24963\/ijcai.2018\/180"},{"key":"5_CR14","first-page":"269","volume-title":"Recent Advances in Mathematical Programming","author":"RE Gomory","year":"1963","unstructured":"Gomory, R.E.: An algorithm for integer solutions of linear programs. In: Graves, R., Wolfe, P. (eds.) Recent Advances in Mathematical Programming, pp. 269\u2013302. McGraw-Hill, New York (1963)"},{"key":"5_CR15","unstructured":"Gurobi optimizer. http:\/\/www.gurobi.com\/"},{"issue":"2\u20133","key":"5_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(2\u20133), 297\u2013308 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Heule, M., Hunt Jr., W.A., Wetzler, N.: Trimming while checking clausal proofs. In: Proceedings of the 13th International Conference on Formal Methods in Computer-Aided Design (FMCAD 2013), pp. 181\u2013188, October 2013","DOI":"10.1109\/FMCAD.2013.6679408"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-38574-2_24","volume-title":"Automated Deduction \u2013 CADE-24","author":"MJH Heule","year":"2013","unstructured":"Heule, M.J.H., Hunt, W.A., Wetzler, N.: Verifying refutations with extended resolution. In: Bonacina, M.P. (ed.) CADE 2013. LNCS (LNAI), vol. 7898, pp. 345\u2013359. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38574-2_24"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-319-23219-5_15","volume-title":"Principles and Practice of Constraint Programming","author":"S Joshi","year":"2015","unstructured":"Joshi, S., Martins, R., Manquinho, V.: Generalized totalizer encoding for pseudo-Boolean constraints. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 200\u2013209. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23219-5_15"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-319-66263-3_30","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2017","author":"M Lauria","year":"2017","unstructured":"Lauria, M., Elffers, J., Nordstr\u00f6m, J., Vinyals, M.: CNFgen: a generator of crafted benchmarks. In: Gaspers, S., Walsh, T. (eds.) SAT 2017. LNCS, vol. 10491, pp. 464\u2013473. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66263-3_30"},{"key":"5_CR21","first-page":"59","volume":"7","author":"D Le Berre","year":"2010","unstructured":"Le Berre, D., Parrain, A.: The Sat4j library, release 2.2. J. Satisf. Boolean Model. Comput. 7, 59\u201364 (2010)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"5_CR22","first-page":"209","volume":"2","author":"VM Manquinho","year":"2006","unstructured":"Manquinho, V.M., Marques-Silva, J.: On using cutting planes in pseudo-Boolean optimization. J. Satisf. Boolean Model. Comput. 2, 209\u2013219 (2006). Preliminary version in SAT 2005","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Manquinho, V.M., Marques-Silva, J.P.: Integration of lower bound estimates in pseudo-Boolean optimization. In: 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), pp. 742\u2013748, November 2004","DOI":"10.1109\/ICTAI.2004.76"},{"issue":"1\u20134","key":"5_CR24","first-page":"221","volume":"2","author":"K Markstr\u00f6m","year":"2006","unstructured":"Markstr\u00f6m, K.: Locality and hard SAT-instances. J. Satisf. Boolean Model. Comput. 2(1\u20134), 221\u2013227 (2006)","journal-title":"J. Satisf. Boolean Model. Comput."},{"issue":"5","key":"5_CR25","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"J.P. Marques-Silva","year":"1999","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48(5), 506\u2013521 (1999). Preliminary version in ICCAD 1996","journal-title":"IEEE Transactions on Computers"},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-319-09284-3_33","volume-title":"Theory and Applications of Satisfiability Testing","author":"R Martins","year":"2014","unstructured":"Martins, R., Manquinho, V., Lynce, I.: Open-WBO: a modular MaxSAT solver. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 438\u2013445. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09284-3_33"},{"key":"5_CR27","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":"5_CR28","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference (DAC 2001), pp. 530\u2013535, June 2001","DOI":"10.1145\/378239.379017"},{"key":"5_CR29","unstructured":"Open-WBO: An open source version of the MaxSAT solver WBO. http:\/\/sat.inesc-id.pt\/open-wbo\/"},{"key":"5_CR30","unstructured":"Pseudo-Boolean competition 2016, July 2016. http:\/\/www.cril.univ-artois.fr\/PB16\/"},{"key":"5_CR31","unstructured":"Roussel, O., Manquinho, V.M.: Pseudo-Boolean and cardinality constraints. In: Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, Chap. 22. Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 695\u2013733. IOS Press, Amsterdam (2009)"},{"key":"5_CR32","unstructured":"Sat4j: The Boolean satisfaction and optimization library in Java. http:\/\/www.sat4j.org\/"},{"issue":"1\u20134","key":"5_CR33","first-page":"165","volume":"2","author":"HM Sheini","year":"2006","unstructured":"Sheini, H.M., Sakallah, K.A.: Pueblo: a hybrid pseudo-Boolean SAT solver. J. Satisf. Boolean Model. Comput. 2(1\u20134), 165\u2013189 (2006). Preliminary version in DATE 2005","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"5_CR34","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"},{"key":"5_CR35","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"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Vinyals, M., Elffers, J., Gir\u00e1ldez-Cru, J., Gocht, S., Nordstr\u00f6m, J.: In between resolution and cutting planes: a study of proof systems for pseudo-Boolean SAT solving, July 2018 (to appear)","DOI":"10.1007\/978-3-319-94144-8_18"},{"key":"5_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-319-09284-3_31","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"N Wetzler","year":"2014","unstructured":"Wetzler, N., Heule, M.J.H., Hunt, W.A.: DRAT-trim: efficient checking and trimming using expressive clausal proofs. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 422\u2013429. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09284-3_31"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94144-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T08:45:37Z","timestamp":1751705137000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94144-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319941431","9783319941448"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94144-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"26 June 2018","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":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sat2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sat2018.azurewebsites.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"58","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":"20","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":"4","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":"34% - 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":"4","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":"7","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":"2 tool papers were accepted","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)"}}]}}