{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:36:03Z","timestamp":1772724963579,"version":"3.50.1"},"publisher-location":"Cham","reference-count":46,"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_27","type":"book-chapter","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T14:13:49Z","timestamp":1625148829000},"page":"387-398","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["The MergeSat Solver"],"prefix":"10.1007","author":[{"given":"Norbert","family":"Manthey","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,2]]},"reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-642-39071-5_23","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2013","author":"G Audemard","year":"2013","unstructured":"Audemard, G., Lagniez, J.-M., Simon, L.: Improving glucose for incremental SAT solving with assumptions: application to MUS extraction. In: J\u00e4rvisalo, M., Van Gelder, A. (eds.) SAT 2013. LNCS, vol. 7962, pp. 309\u2013317. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39071-5_23"},{"key":"27_CR2","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern sat solvers. In: Proceedings of the 21st International Jont Conference on Artifical Intelligence, IJCAI\u201909, pp. 399\u2013404. Morgan Kaufmann Publishers Inc., San Francisco (2009)"},{"key":"27_CR3","unstructured":"Balint, A., Belov, A., Heule, M.J., J\u00e4rvisalo, M. (eds.): Proceedings of SAT Challenge 2013, Department of Computer Science Series of Publications B, vol. B-2013-1. University of Helsinki, Helsinki, Finland (2013)"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.artint.2016.08.007","volume":"241","author":"T Balyo","year":"2016","unstructured":"Balyo, T., Biere, A., Iser, M., Sinz, C.: SAT race 2015. Artif. Intell. 241, 45\u201365 (2016)","journal-title":"Artif. Intell."},{"key":"27_CR5","unstructured":"Balyo, T., Froleyks, N., Heule, M., Iser, M., J\u00e4rvisalo, M., Suda, M. (eds.): Department of Computer Science Report Series B, vol. B-2020-1. University of Helsinki (2020)"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-24318-4_12","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"T Balyo","year":"2015","unstructured":"Balyo, T., Sanders, P., Sinz, C.: HordeSat: a massively parallel portfolio SAT solver. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 156\u2013172. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24318-4_12"},{"key":"27_CR7","unstructured":"Balyo, T., Heule, M., J\u00e4rvisalo, M.: Proceedings of SAT Competition 2017: Solver and Benchmark Descriptions, Series of Publications B, vol. B-2017-1. Department of Computer Science, University of Helsinki, Finland (2017)"},{"key":"27_CR8","unstructured":"Balyo, T., Heule, M.: Proceedings of SAT Competition 2016: Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B, University of Helsinki, Finland (2016)"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Bayless, S., Bayless, N., Hoos, H.H., Hu, A.J.: Sat modulo monotonic theories. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI\u201915, pp. 3702\u20133709. AAAI Press (2015)","DOI":"10.1609\/aaai.v29i1.9755"},{"key":"27_CR10","unstructured":"Belov, A., Diepold, D., Heule, M.J., J\u00e4rvisalo, M. (eds.): Proceedings of SAT Competition 2014, Department of Computer Science Series of Publications B, vol. B-2014-2. University of Helsinki, Helsinki, Finland (2014)"},{"key":"27_CR11","unstructured":"Biere, A.: PrecoSAT system description (2009). http:\/\/fmv.jku.at\/precosat\/preicosat-sc09.pdf"},{"key":"27_CR12","unstructured":"Biere, A.: Lingeling, Plingeling, PicoSAT and PrecoSAT at SAT Race 2010. FMV Report Series Technical Report 10\/1, Johannes Kepler University, Linz, Austria (2010)"},{"key":"27_CR13","unstructured":"Biere, A.: CaDiCaL, Lingeling, Plingeling, Treengeling, YalSAT entering the SAT competition 2017. In: Balyo, T., Heule, M., J\u00e4rvisalo, M. (eds.) Proceedings of SAT Competition 2017 - Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B, vol. B-2017-1, pp. 14\u201315. University of Helsinki (2017)"},{"key":"27_CR14","unstructured":"Biere, A., Fazekas, K., Fleury, M., Heisinger, M.: CaDiCaL, kissat, paracooba, plingeling and treengeling entering the SAT competition 2020. In: Balyo, T., Froleyks, N., Heule, M., Iser, M., J\u00e4rvisalo, M., Suda, M. (eds.) Proc. of SAT Competition 2020 - Solver and Benchmark Descriptions. Department of Computer Science Report Series B, vol. B-2020-1, pp. 51\u201353. University of Helsinki (2020)"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Brummayer, R., Biere, A.: Fuzzing and delta-debugging SMT solvers. In: Workshop SMT 2010, pp. 1\u20135. ACM (2009)","DOI":"10.1145\/1670412.1670413"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-24730-2_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Clarke","year":"2004","unstructured":"Clarke, E., Kroening, D., Lerda, F.: A tool for checking ANSI-C programs. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 168\u2013176. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24730-2_15"},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Ehlers, T., Nowotka, D.: Tuning parallel sat solvers. In: Berre, D.L., J\u00e4rvisalo, M. (eds.) Proceedings of Pragmatics of SAT 2015 and 2018. EPiC Series in Computing, vol. 59, pp. 127\u2013143. EasyChair (2019). https:\/\/easychair.org\/publications\/paper\/NkG7","DOI":"10.29007\/w15s"},{"key":"27_CR19","unstructured":"Xiao, F., Luo, M., Li., C.M., Manya F., L\u00fc, Z.: MapleLRB\\_LCM, Maple\\_LCM, Maple\\_LCM\\_Dist, MapleLRB\\_LCMoccRestart and Glucose-3.0+width in SAT Competition (2017)"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Fichte, J.K., Manthey, N., Stecklina, J., Schidler, A.: Towards faster reasoners by using transparent huge pages (2020). https:\/\/arxiv.org\/abs\/2004.14378","DOI":"10.1007\/978-3-030-58475-7_18"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Heule Jr, M., Warren, A.H., Wetzler, N.: Trimming while checking clausal proofs. In: FMCAD (2013)","DOI":"10.1109\/FMCAD.2013.6679408"},{"key":"27_CR22","unstructured":"Heule, M., J\u00e4rvisalo, M., Suda, M. (eds.): Proceedings of SAT Competition 2018: Solver and Benchmark Descriptions, Department of Computer Science Series of Publications B, vol. B-2018-1. Department of Computer Science, University of Helsinki, Finland (2018)"},{"key":"27_CR23","unstructured":"Heule, M., J\u00e4rvisalo, M., Suda, M. (eds.): Proceedings of SAT Race 2019: Solver and Benchmark Descriptions, Department of Computer Science Report Series B, vol. B-2019-1. Department of Computer Science, University of Helsinki, Finland (2019)"},{"key":"27_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-030-24258-9_11","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2019","author":"R Hickey","year":"2019","unstructured":"Hickey, R., Bacchus, F.: Speeding up assumption-based SAT. In: Janota, M., Lynce, I. (eds.) SAT 2019. LNCS, vol. 11628, pp. 164\u2013182. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24258-9_11"},{"key":"27_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-030-51825-7_4","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2020","author":"R Hickey","year":"2020","unstructured":"Hickey, R., Bacchus, F.: Trail saving on backtrack. In: Pulina, L., Seidl, M. (eds.) SAT 2020. LNCS, vol. 12178, pp. 46\u201361. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51825-7_4"},{"key":"27_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-642-16242-8_37","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"S H\u00f6lldobler","year":"2010","unstructured":"H\u00f6lldobler, S., Manthey, N., Saptawijaya, A.: Improving resource-unaware SAT solvers. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR 2010. LNCS, vol. 6397, pp. 519\u2013534. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16242-8_37"},{"key":"27_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-44973-4_16","volume-title":"Learning and Intelligent Optimization","author":"HH Hoos","year":"2013","unstructured":"Hoos, H.H., Kaufmann, B., Schaub, T., Schneider, M.: Robust benchmark set selection for boolean constraint solvers. In: Nicosia, G., Pardalos, P. (eds.) LION 2013. LNCS, vol. 7997, pp. 138\u2013152. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-44973-4_16"},{"issue":"1","key":"27_CR28","first-page":"267","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: Paramils: an automatic algorithm configuration framework. J. Artif. Int. Res. 36(1), 267\u2013306 (2009)","journal-title":"J. Artif. Int. Res."},{"key":"27_CR29","unstructured":"Liang, J.H., Chanseok Oh, V.G.K.C., Poupart, P.: MapleCOMSPS, MapleCOMSPS_LRB, MapleCOMSPS$$\\_$$CHB. In: Proceedings of SAT Competition 2016 (2016). http:\/\/hdl.handle.net\/10138\/164630"},{"key":"27_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-21581-0_27","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"H Katebi","year":"2011","unstructured":"Katebi, H., Sakallah, K.A., Marques-Silva, J.P.: Empirical study of the anatomy of modern sat solvers. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol. 6695, pp. 343\u2013356. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21581-0_27"},{"key":"27_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-030-51825-7_11","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2020","author":"S Kochemazov","year":"2020","unstructured":"Kochemazov, S.: Improving implementation of SAT competitions 2017\u20132019 winners. In: Pulina, L., Seidl, M. (eds.) SAT 2020. LNCS, vol. 12178, pp. 139\u2013148. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51825-7_11"},{"key":"27_CR32","unstructured":"Kottler, S.: Description of the sapperlot, sartagnan and moussaka solvers for the sat-competition 2011 (2011)"},{"key":"27_CR33","unstructured":"Manthey, N.: Refining unsatisfiable cores in incremental SAT solving. Technical report, TU Dresden (2015)"},{"key":"27_CR34","doi-asserted-by":"crossref","unstructured":"Manthey, N., Lindauer, M.: Spybug: Automated bug detection in the configuration space of sat solvers. In: SAT, pp. 554\u2013561 (2016)","DOI":"10.1007\/978-3-319-40970-2_36"},{"key":"27_CR35","doi-asserted-by":"publisher","unstructured":"Luo, M., Li, C.M., Xiao, F., Manya, F., L\u00fc, Z.: An effective learnt clause minimization approach for CDCL SAT solvers. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI-17, pp. 703\u2013711 (2017). https:\/\/doi.org\/10.24963\/ijcai.2017\/98","DOI":"10.24963\/ijcai.2017\/98"},{"key":"27_CR36","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 \u2013 SAT 2014","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":"27_CR37","unstructured":"ML4AAD Group: SMAC v3 project. https:\/\/github.com\/automl\/SMAC3 (2017), version visited last on August 2017"},{"key":"27_CR38","unstructured":"M\u00f6hle, S., Manthey, N.: Better evaluations by analyzing benchmark structure, pp. 1\u201310 (2016). http:\/\/www.pragmaticsofsat.org\/2016\/reg\/POS-16_paper_4.pdf"},{"key":"27_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-319-94144-8_7","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2018","author":"A Nadel","year":"2018","unstructured":"Nadel, A., Ryvchin, V.: Chronological backtracking. In: Beyersdorff, O., Wintersteiger, C.M. (eds.) SAT 2018. LNCS, vol. 10929, pp. 111\u2013121. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94144-8_7"},{"key":"27_CR40","doi-asserted-by":"publisher","unstructured":"Nethercote, N., Seward, J.: Valgrind: A framework for heavyweight dynamic binary instrumentation. SIGPLAN Not. 42(6), 89\u2013100 (2007). https:\/\/doi.org\/10.1145\/1273442.1250746","DOI":"10.1145\/1273442.1250746"},{"key":"27_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-319-24318-4_23","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"C Oh","year":"2015","unstructured":"Oh, C.: Between SAT and UNSAT: the fundamental difference in CDCL SAT. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 307\u2013323. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24318-4_23"},{"key":"27_CR42","unstructured":"Ryvchin, V., Nadel, A.: Maple$$\\_$$LCM$$\\_$$Dist$$\\_$$ChronoBT: featuring chronological backtracking. In: Proceedings of SAT Competition 2018 (2018). http:\/\/hdl.handle.net\/10138\/237063"},{"key":"27_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-02777-2_24","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"M Soos","year":"2009","unstructured":"Soos, M., Nohl, K., Castelluccia, C.: Extending SAT solvers to cryptographic problems. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 244\u2013257. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_24"},{"key":"27_CR44","unstructured":"Kochemazov, S., Oleg Zaikin, V.K., Semenov, A.: Maplelcmdistchronobt-dl, duplicate learnts heuristic-aided solvers at the sat race 2019 (2019)"},{"issue":"4","key":"27_CR45","first-page":"133","volume":"7","author":"P van der Tak","year":"2011","unstructured":"van der Tak, P., Ramos, A., Heule, M.: Reusing the assignment trail in cdcl solvers. JSAT 7(4), 133\u2013138 (2011)","journal-title":"JSAT"},{"key":"27_CR46","unstructured":"Zhang, X., Cai, S.: Relaxed backtracking with rephasing. In: Balyo, T., Froleyks, N., Heule, M., Iser, M., J\u00e4rvisalo, M., Suda, M. (eds.) Proceedings of SAT Competition 2020 - Solver and Benchmark Descriptions. Department of Computer Science Report Series B, vol. B-2020-1, pp. 15\u201315. University of Helsinki (2020)"}],"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_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,5]],"date-time":"2023-11-05T14:34:33Z","timestamp":1699194873000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80223-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030802226","9783030802233"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80223-3_27","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"}}]}}