{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:18:09Z","timestamp":1781075889234,"version":"3.54.1"},"publisher-location":"Cham","reference-count":28,"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_32","type":"book-chapter","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T14:13:49Z","timestamp":1625148829000},"page":"471-487","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Leveraging GPUs for Effective Clause Sharing in Parallel SAT Solving"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Prevot","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mate","family":"Soos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kuldeep S.","family":"Meel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,7,2]]},"reference":[{"key":"32_CR1","unstructured":"Relaxed backtracking with rephasing. In Proceedings of SAT Competition 2020: Solver and Benchmark Descriptions, Department of Computer Science Report Series B 2020\u20131, pp. 15\u201316. University of Helsinki (2020)"},{"key":"32_CR2","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Boutilier, C. (ed.) IJCAI 2009, pp. 399\u2013404 (2009)"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-09284-3_15","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"G Audemard","year":"2014","unstructured":"Audemard, G., Simon, L.: Lazy clause exchange policy for parallel SAT solvers. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 197\u2013205. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09284-3_15"},{"key":"32_CR4","unstructured":"Beckers, S., De Samblanx, G., De Smedt, F., Goedeme, T., Struyf, L., Vennekens, J.: Parallel hybrid SAT solving using OpenCL. In: Benelux Conference on Artificial Intelligence. Springer (2012)"},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-540-79719-7_4","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"A Biere","year":"2008","unstructured":"Biere, A.: Adaptive restart strategies for conflict driven SAT solvers. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 28\u201333. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79719-7_4"},{"key":"32_CR6","unstructured":"Biere, A.: Lingeling, plingeling and treengeling entering the SAT competition 2013. In: Proceedings of SAT Competition 2013, vol. B-2013-1 of Department of Computer Science Series, pp. 51\u201352. University of Helsinki (2013)"},{"issue":"10","key":"32_CR7","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theor. Exp. 2008(10), P10008 (2008)","journal-title":"J. Stat. Mech. Theor. Exp."},{"issue":"2","key":"32_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/rsa.20057","volume":"27","author":"A Braunstein","year":"2005","unstructured":"Braunstein, A., M\u00e9zard, M., Zecchina, R.: Survey propagation: an algorithm for satisfiability. Random Struct. Algorithms 27(2), 201\u2013226 (2005)","journal-title":"Random Struct. Algorithms"},{"key":"32_CR9","unstructured":"Coates, A., Huval, B., Wang, T., Wu, D.J., Catanzaro, B., Andrew, Y.N.: Deep learning with COTS HPC systems. In: Proceedings of the 30th International Conference on Machine Learning, ICML 2013, Atlanta, GA, USA, 16\u201321 June 2013, volume 28 of JMLR Workshop and Conference Proceedings, pp. 1337\u20131345. JMLR.org (2013)"},{"issue":"5","key":"32_CR10","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1109\/JSSC.1974.1050511","volume":"9","author":"RH Dennard","year":"1974","unstructured":"Dennard, R.H., Gaensslen, F.H., Yu, H., Rideout, V.L., Bassous, E., LeBlanc, A.R.: Design of ion-implanted MOSFET\u2019s with very small physical dimensions. IEEE J. Solid-State Circuits 9(5), 256\u2013268 (1974)","journal-title":"IEEE J. Solid-State Circuits"},{"issue":"4","key":"32_CR11","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1214\/aoms\/1177731363","volume":"14","author":"R Dorfman","year":"1943","unstructured":"Dorfman, R.: The detection of defective members of large populations. Ann. Math. Stat. 14(4), 436\u2013440 (1943)","journal-title":"Ann. Math. Stat."},{"key":"32_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11499107_5","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2005","unstructured":"E\u00e9n, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 61\u201375. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11499107_5"},{"key":"32_CR13","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"},{"issue":"4","key":"32_CR14","first-page":"245","volume":"6","author":"Y Hamadi","year":"2009","unstructured":"Hamadi, Y., Jabbour, S., Sais, L.: Manysat: a parallel SAT solver. J. Satisf. Boolean Model. Comput. 6(4), 245\u2013262 (2009)","journal-title":"J. Satisf. Boolean Model. Comput."},{"issue":"2\u20134","key":"32_CR15","first-page":"99","volume":"4","author":"M Heule","year":"2008","unstructured":"Heule, M., van Maaren, H.: Parallel SAT solving using bit-level operations. J. Satisf. Boolean Model. Comput. 4(2\u20134), 99\u2013116 (2008)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"32_CR16","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol. 4, Fascicle 6: Satisfiability, 1st edn. Addison-Wesley Professional, Boston (2015)"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Malik, S., Zhao, Y., Madigan, C.F., Zhang, L., Moskewicz, M.W.: Chaff: engineering an efficient SAT solver. In: Design Automation Conference, pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"key":"32_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/11814948_30","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"P Manolios","year":"2006","unstructured":"Manolios, P., Zhang, Y.: Implementing survey propagation on graphics processing units. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 311\u2013324. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814948_30"},{"key":"32_CR19","unstructured":"Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning sat solvers. In: Handbook of Satisfiability, pp. 131\u2013153. IOS Press (2009)"},{"issue":"3\u20134","key":"32_CR20","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1018999721141","volume":"22","author":"B Mazure","year":"1998","unstructured":"Mazure, B., Sais, L., Gr\u00e9goire, \u00c9.: Boosting complete techniques thanks to local search methods. Ann. Math. Artif. Intell. 22(3\u20134), 319\u2013331 (1998)","journal-title":"Ann. Math. Artif. Intell."},{"key":"32_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-030-17462-0_2","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Osama","year":"2019","unstructured":"Osama, M., Wijs, A.: Parallel SAT simplification on GPU architectures. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019, Part I. LNCS, vol. 11427, pp. 21\u201340. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17462-0_2"},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"Osama, M., Wijs, A., Biere, A.: Sat solving with GPU accelerated inprocessing. In: Proceedings of TACAS (2021)","DOI":"10.26226\/morressier.604907f41a80aac83ca25cee"},{"issue":"3","key":"32_CR23","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1080\/0952813X.2014.954274","volume":"27","author":"A Dal Pal\u00f9","year":"2015","unstructured":"Dal Pal\u00f9, A., Dovier, A., Formisano, A., Pontelli, E.: Cud@sat: SAT solving on GPUs. J. Exp. Theor. Artif. Intell. 27(3), 293\u2013316 (2015)","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"32_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-72788-0_28","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"K Pipatsrisawat","year":"2007","unstructured":"Pipatsrisawat, K., Darwiche, A.: A lightweight component caching scheme for satisfiability solvers. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 294\u2013299. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72788-0_28"},{"key":"32_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-540-79719-7_25","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"V Ryvchin","year":"2008","unstructured":"Ryvchin, V., Strichman, O.: Local restarts. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 271\u2013276. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79719-7_25"},{"key":"32_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-030-51825-7_2","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2020","author":"V Vallade","year":"2020","unstructured":"Vallade, V., Le Frioux, L., Baarir, S., Sopena, J., Ganesh, V., Kordon, F.: Community and LBD-based clause sharing policy for parallel SAT solving. In: Pulina, L., Seidl, M. (eds.) SAT 2020. LNCS, vol. 12178, pp. 11\u201327. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51825-7_2"},{"key":"32_CR27","unstructured":"van der Tak, P., Heule, M., Biere, A.: Concurrent cube-and-conquer. CoRR, abs\/1402.4465 (2014)"},{"issue":"4","key":"32_CR28","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1006\/jsco.1996.0030","volume":"21","author":"H Zhang","year":"1996","unstructured":"Zhang, H., Bonacina, M.P., Hsiang, J.: PSATO: a distributed propositional prover and its application to quasigroup problems. J. Symb. Comput. 21(4), 543\u2013560 (1996)","journal-title":"J. Symb. Comput."}],"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_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T03:16:11Z","timestamp":1725333371000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80223-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030802226","9783030802233"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80223-3_32","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"}}]}}