{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T20:15:40Z","timestamp":1784837740310,"version":"3.55.0"},"publisher-location":"Cham","reference-count":31,"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_35","type":"book-chapter","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T14:13:49Z","timestamp":1625148829000},"page":"518-534","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Scalable SAT Solving in the Cloud"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4185-1851","authenticated-orcid":false,"given":"Dominik","family":"Schreiber","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3330-9349","authenticated-orcid":false,"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,7,2]]},"reference":[{"key":"35_CR1","unstructured":"Audemard, G., Hoessen, B., Jabbour, S., Piette, C.: Dolius: a distributed parallel SAT solving framework. In: Pragmatics of SAT, pp. 1\u201311. Citeseer (2014)"},{"key":"35_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-319-44953-1_3","volume-title":"Principles and Practice of Constraint Programming","author":"G Audemard","year":"2016","unstructured":"Audemard, G., Lagniez, J.-M., Szczepanski, N., Tabary, S.: An adaptive parallel SAT solver. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 30\u201348. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44953-1_3"},{"key":"35_CR3","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Twenty-First International Joint Conference on Artificial Intelligence, pp. 399\u2013404 (2009)"},{"key":"35_CR4","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":"35_CR5","unstructured":"Biere, A.: Yet another local search solver and Lingeling and friends entering the SAT competition 2014. In: Proceedings of SAT Competition, p. 65 (2014)"},{"key":"35_CR6","unstructured":"Biere, A.: Splatz, Lingeling, Plingeling, Treengeling, YalSAT entering the SAT competition 2016. Proceedings of SAT Competition pp. 44\u201345 (2016)"},{"key":"35_CR7","unstructured":"Biere, A.: CaDiCaL, Lingeling, Plingeling, Treengeling and YalSAT entering the SAT competition 2018. In: Proceedings of SAT Competition, pp. 14\u201315 (2018)"},{"key":"35_CR8","unstructured":"Biere, A., Fazekas, K., Fleury, M., Heisinger, M.: CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT competition 2020. In: Proceedings of SAT Competition, p. 50 (2020)"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Ehlers, T., Nowotka, D., Sieweck, P.: Communication in massively-parallel SAT solving. In: 2014 IEEE 26th International Conference on Tools with Artificial Intelligence, pp. 709\u2013716. IEEE (2014)","DOI":"10.1109\/ICTAI.2014.111"},{"key":"35_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0022284","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"DG Feitelson","year":"1996","unstructured":"Feitelson, D.G., Rudolph, L.: Toward convergence in job schedulers for parallel supercomputers. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1996. LNCS, vol. 1162, pp. 1\u201326. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0022284"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Froleyks, N., Heule, M., Iser, M., J\u00e4rvisalo, M., Suda, M.: SAT Competition 2020. In: Artificial Intelligence (2021, to appear)","DOI":"10.1016\/j.artint.2021.103572"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Graham, R.L., Shipman, G.M., Barrett, B.W., Castain, R.H., Bosilca, G., Lumsdaine, A.: Open MPI: a high-performance, heterogeneous MPI. In: 2006 IEEE International Conference on Cluster Computing, pp. 1\u20139. IEEE (2006)","DOI":"10.1109\/CLUSTR.2006.311904"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Gropp, W., Gropp, W.D., Lusk, E., Skjellum, A., Lusk, E.: Using MPI: portable parallel programming with the message-passing interface, vol. 1. MIT Press, Cambridge (1999)","DOI":"10.7551\/mitpress\/7056.001.0001"},{"issue":"4","key":"35_CR14","first-page":"245","volume":"6","author":"Y Hamadi","year":"2010","unstructured":"Hamadi, Y., Jabbour, S., Sais, L.: ManySAT: a parallel SAT solver. J. Satisf. Boolean Model. Comput. 6(4), 245\u2013262 (2010)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"35_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-030-51825-7_9","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2020","author":"M Heisinger","year":"2020","unstructured":"Heisinger, M., Fleury, M., Biere, A.: Distributed cube and conquer with paracooba. In: Pulina, L., Seidl, M. (eds.) SAT 2020. LNCS, vol. 12178, pp. 114\u2013122. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51825-7_9"},{"key":"35_CR16","unstructured":"Heule, M., J\u00e4rvisalo, M., Suda, M.: SAT race 2019 (2019). http:\/\/sat-race-2019.ciirc.cvut.cz\/downloads\/satrace19slides.pdf. Accessed 13 May 2021"},{"key":"35_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-34188-5_8","volume-title":"Hardware and Software: Verification and Testing","author":"MJH Heule","year":"2012","unstructured":"Heule, M.J.H., Kullmann, O., Wieringa, S., Biere, A.: Cube and conquer: guiding CDCL SAT solvers by Lookaheads. In: Eder, K., Louren\u00e7o, J., Shehory, O. (eds.) HVC 2011. LNCS, vol. 7261, pp. 50\u201365. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34188-5_8"},{"issue":"4","key":"35_CR18","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1023\/A:1006350622830","volume":"24","author":"HH Hoos","year":"2000","unstructured":"Hoos, H.H., St\u00fctzle, T.: Local search algorithms for SAT: an empirical evaluation. J. Autom. Reason. 24(4), 421\u2013481 (2000)","journal-title":"J. Autom. Reason."},{"key":"35_CR19","unstructured":"Hungershofer, J.: On the combined scheduling of malleable and rigid jobs. In: 16th Symposium on Computer Architecture and High Performance Computing, pp. 206\u2013213. IEEE (2004)"},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Iser, M., Balyo, T., Sinz, C.: Memory efficient parallel SAT solving with inprocessing. In: 2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI), pp. 64\u201370. IEEE (2019)","DOI":"10.1109\/ICTAI.2019.00018"},{"key":"35_CR21","first-page":"144","volume":"59","author":"M Iser","year":"2019","unstructured":"Iser, M., Sinz, C.: A problem meta-data library for research in SAT. Proc. Pragmatics SAT 59, 144\u2013152 (2019)","journal-title":"Proc. Pragmatics SAT"},{"key":"35_CR22","unstructured":"Kendall, M.G.: Rank Correlation Methods. Griffin, London (1948)"},{"key":"35_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-030-32409-4_2","volume-title":"Formal Methods and Software Engineering","author":"M Kleine B\u00fcning","year":"2019","unstructured":"Kleine B\u00fcning, M., Balyo, T., Sinz, C.: Using DimSpec for bounded and unbounded software model checking. In: Ait-Ameur, Y., Qin, S. (eds.) ICFEM 2019. LNCS, vol. 11852, pp. 19\u201335. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32409-4_2"},{"key":"35_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-319-66263-3_15","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2017","author":"L Le Frioux","year":"2017","unstructured":"Le Frioux, L., Baarir, S., Sopena, J., Kordon, F.: PaInleSS: a framework for parallel SAT solving. In: Gaspers, S., Walsh, T. (eds.) SAT 2017. LNCS, vol. 10491, pp. 233\u2013250. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66263-3_15"},{"key":"35_CR25","unstructured":"Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: Handbook of Satisfiability, pp. 131\u2013153 (2009). IOS Press"},{"issue":"1","key":"35_CR26","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1006326723002","volume":"24","author":"F Massacci","year":"2000","unstructured":"Massacci, F., Marraro, L.: Logical cryptanalysis as a SAT problem. J. Autom. Reason. 24(1), 165\u2013203 (2000)","journal-title":"J. Autom. Reason."},{"key":"35_CR27","doi-asserted-by":"publisher","unstructured":"Mehlhorn, K., Sanders, P.: Algorithms and data structures: the basic toolbox. Springer Science & Business Media, Berlin (2008). https:\/\/doi.org\/10.1007\/978-3-540-77978-0","DOI":"10.1007\/978-3-540-77978-0"},{"issue":"2","key":"35_CR28","doi-asserted-by":"publisher","first-page":"261","DOI":"10.2478\/amcs-2019-0019","volume":"29","author":"Y Ngoko","year":"2019","unstructured":"Ngoko, Y., C\u00e9rin, C., Trystram, D.: Solving SAT in a distributed cloud: a portfolio approach. Int. J. Appl. Math. Comput. Sci. 29(2), 261\u2013274 (2019)","journal-title":"Int. J. Appl. Math. Comput. Sci."},{"key":"35_CR29","doi-asserted-by":"crossref","unstructured":"Ngoko, Y., Trystram, D., C\u00e9rin, C.: A distributed cloud service for the resolution of SAT. In: 2017 IEEE 7th International Symposium on Cloud and Service Computing (SC2), pp. 1\u20138. IEEE (2017)","DOI":"10.1109\/SC2.2017.9"},{"key":"35_CR30","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1613\/jair.1.12520","volume":"70","author":"D Schreiber","year":"2021","unstructured":"Schreiber, D.: Lilotane: a lifted SAT-based approach to hierarchical planning. J. Artif. Intell. Res. 70, 1117\u20131181 (2021)","journal-title":"J. Artif. Intell. Res."},{"issue":"4","key":"35_CR31","doi-asserted-by":"publisher","first-page":"203","DOI":"10.3233\/SAT190068","volume":"6","author":"T Schubert","year":"2010","unstructured":"Schubert, T., Lewis, M., Becker, B.: PaMiraXT: parallel SAT solving with threads and message passing. J. Satisfiability, Boolean Model. Comput. 6(4), 203\u2013222 (2010)","journal-title":"J. Satisfiability, Boolean Model. 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_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,5]],"date-time":"2023-11-05T14:34:16Z","timestamp":1699194856000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80223-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030802226","9783030802233"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80223-3_35","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"}}]}}