{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:41:38Z","timestamp":1743111698068,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031208614"},{"type":"electronic","value":"9783031208621"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-20862-1_6","type":"book-chapter","created":{"date-parts":[[2022,11,3]],"date-time":"2022-11-03T23:29:12Z","timestamp":1667518152000},"page":"75-89","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dagster: Parallel Structured Search with\u00a0Case Studies"],"prefix":"10.1007","author":[{"given":"Mark Alexander","family":"Burgess","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles","family":"Gretton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josh","family":"Milthorpe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luke","family":"Croak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Willingham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alwen","family":"Tiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,4]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-319-66263-3_14","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2017","author":"G Audemard","year":"2017","unstructured":"Audemard, G., Lagniez, J.-M., Szczepanski, N., Tabary, S.: A distributed version of Syrup. In: Gaspers, S., Walsh, T. (eds.) SAT 2017. LNCS, vol. 10491, pp. 215\u2013232. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66263-3_14"},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3182657","volume":"51","author":"R Baldoni","year":"2018","unstructured":"Baldoni, R., Coppa, E., D\u2019Elia, D.C., Demetrescu, C., Finocchi, I.: A survey of symbolic execution techniques. ACM Comput. Surv. 51(3), 1\u201339 (2018)","journal-title":"ACM Comput. Surv."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Balyo, T., Sanders, P., Sinz, C.: HordeSat: a massively parallel portfolio SAT solver. In: Theory and Applications of Satisfiability Testing - SAT 2015 (2015)","DOI":"10.1007\/978-3-319-24318-4_12"},{"key":"6_CR4","unstructured":"Biere, A.: Lingeling, Plingeling, PicoSAT and PrecoSAT at SAT Race 2010. FMV Technical Report 10\/1, Johannes Kepler University, Linz, Austria (2010)"},{"key":"6_CR5","unstructured":"Biere, A.: Splatz, Lingeling, PLingeling, Treengeling, YalSAT. In: Proceedings of the SAT Competition, pp. 44\u201345 (2016)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0065-2458(03)58003-2","volume":"58","author":"A Biere","year":"2003","unstructured":"Biere, A., Cimatti, A., Clarke, E.M., Strichman, O., Zhu, Y.: Bounded model checking. Adv. Comput. 58, 117\u2013148 (2003)","journal-title":"Adv. Comput."},{"key":"6_CR7","unstructured":"Biere, A., Fleury, M.: Chasing target phases. In: 11th Workshop on Pragmatics of SAT (POS 2020) (2020)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-18275-4_7","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"AR Bradley","year":"2011","unstructured":"Bradley, A.R.: SAT-based model checking without unrolling. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 70\u201387. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18275-4_7"},{"key":"6_CR9","unstructured":"Brafman, R.I., Domshlak, C.: Factored planning: how, when, and when not. In: 21st National Conference on Artificial Intelligence and 18th Innovative Applications of Artificial Intelligence Conference, pp. 809\u2013814. AAAI Press (2006)"},{"key":"6_CR10","unstructured":"Brown, C.P., Cenkl, M., Games, R.A., Rushanan, J.J., Moreno, O., Pei, P.: New enumeration results for Costas arrays. In: IEEE International Symposium on Information Theory (1993)"},{"key":"6_CR11","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.7016083","author":"MA Burgess","year":"2022","unstructured":"Burgess, M.A.: Dagster - parallel structured search - source code (2022). https:\/\/doi.org\/10.5281\/zenodo.7016083","journal-title":"Dagster - parallel structured search - source code"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-80223-3_6","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2021","author":"S Cai","year":"2021","unstructured":"Cai, S., Zhang, X.: Deep cooperation of CDCL and local search for SAT. In: Li, C.-M., Many\u00e0, F. (eds.) SAT 2021. LNCS, vol. 12831, pp. 64\u201381. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-80223-3_6"},{"key":"6_CR13","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"},{"issue":"4","key":"6_CR14","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1109\/TSE.2011.59","volume":"38","author":"LC Cordeiro","year":"2012","unstructured":"Cordeiro, L.C., Fischer, B., Marques-Silva, J.: SMT-based bounded model checking for embedded ANSI-C software. IEEE Trans. Software Eng. 38(4), 957\u2013974 (2012)","journal-title":"IEEE Trans. Software Eng."},{"issue":"3","key":"6_CR15","doi-asserted-by":"publisher","first-page":"547","DOI":"10.3934\/amc.2011.5.547","volume":"5","author":"K Drakakis","year":"2011","unstructured":"Drakakis, K., Iorio, F., Rickard, S., Walsh, J.: Results of the enumeration of Costas arrays of order 29. Adv. Math. Commun. 5(3), 547\u2013553 (2011)","journal-title":"Adv. Math. Commun."},{"issue":"10","key":"6_CR16","doi-asserted-by":"publisher","first-page":"4684","DOI":"10.1109\/TIT.2008.928979","volume":"54","author":"K Drakakis","year":"2008","unstructured":"Drakakis, K., et al.: Results of the enumeration of Costas arrays of order $$27$$. IEEE Trans. Inf. Theory 54(10), 4684\u20134687 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_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":"6_CR18","doi-asserted-by":"crossref","unstructured":"Falke, S., Merz, F., Sinz, C.: The bounded model checker LLBMC. In: ASE, pp. 706\u2013709. IEEE (2013)","DOI":"10.1109\/ASE.2013.6693138"},{"key":"6_CR19","unstructured":"Frioux, L.L., Baarir, S., Sopena, J., Kordon, F.: PaInleSS: a framework for parallel SAT solving. In: Theory and Applications of Satisfiability Testing - SAT 2017 (2017)"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Gadelha, M.R., Menezes, R.S., Cordeiro, L.C.: ESBMC 6.1: automated test case generation using bounded model checking. Int. J. Softw. Tools Technol. Transf. 23(6), 857\u2013861 (2021)","DOI":"10.1007\/s10009-020-00571-2"},{"issue":"1\u20133","key":"6_CR21","first-page":"71","volume":"6","author":"L Gil","year":"2009","unstructured":"Gil, L., Flores, P.F., Silveira, L.M.: PMSat: a parallel version of MiniSAT. J. Satisfiability Boolean Model. Comput. 6(1\u20133), 71\u201398 (2009)","journal-title":"J. Satisfiability Boolean Model. Comput."},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Habet, D., Paris, L., Terrioux, C.: A tree decomposition based approach to solve structured SAT instances. In: 2009 21st IEEE International Conference on Tools with Artificial Intelligence, pp. 115\u2013122. IEEE Computer Society (2009)","DOI":"10.1109\/ICTAI.2009.76"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Hamadi, Y., Wintersteiger, C.: Seven challenges in parallel SAT solving. In: AAAI Conference on Artificial Intelligence (2012)","DOI":"10.1609\/aimag.v34i2.2450"},{"key":"6_CR24","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":"6_CR25","doi-asserted-by":"crossref","unstructured":"Hosseini-Khayat, S.: A lightweight security protocol for ultra-low power ASIC implementation for wireless implantable medical devices. In: 2011 5th International Symposium on Medical Information and Communication Technology, pp. 6\u20139 (2011)","DOI":"10.1109\/ISMICT.2011.5759785"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1007\/978-3-540-74970-7_62","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"J Huang","year":"2007","unstructured":"Huang, J.: A case for simple SAT solvers. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 839\u2013846. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_62"},{"key":"6_CR27","unstructured":"Huang, J.: The effect of restarts on the efficiency of clause learning. In: 20th International Joint Conference on Artificial Intelligence (IJCAI), pp. 2318\u20132323 (2007)"},{"issue":"3","key":"6_CR28","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.tcs.2008.03.013","volume":"404","author":"F Ivancic","year":"2008","unstructured":"Ivancic, F., Yang, Z., Ganai, M.K., Gupta, A., Ashar, P.: Efficient SAT-based bounded model checking for software verification. Theoret. Comput. Sci. 404(3), 256\u2013274 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-54862-8_26","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Kroening","year":"2014","unstructured":"Kroening, D., Tautschnig, M.: CBMC \u2013 C bounded model checker. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 389\u2013391. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_26"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Lagniez, J., Marquis, P., Szczepanski, N.: DMC: a distributed model counter. In: Lang, J. (ed.) Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, Stockholm, Sweden, 13\u201319 July 2018, pp. 1331\u20131338. ijcai.org (2018)","DOI":"10.24963\/ijcai.2018\/185"},{"key":"6_CR31","unstructured":"Message Passing Interface Forum: MPI: A Message-Passing Interface Standard Version 3.1, June 2015"},{"key":"6_CR32","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, Las Vegas, NV, USA, 18\u201322 June 2001, pp. 530\u2013535. ACM (2001)","DOI":"10.1145\/378239.379017"},{"issue":"2\u20134","key":"6_CR33","doi-asserted-by":"publisher","first-page":"149","DOI":"10.3233\/SAT190042","volume":"4","author":"DN Pham","year":"2008","unstructured":"Pham, D.N., Thornton, J., Gretton, C., Sattar, A.: Combining adaptive and dynamic local search for satisfiability. J. Satisfiability Boolean Model. Comput. 4(2\u20134), 149\u2013172 (2008)","journal-title":"J. Satisfiability Boolean Model. Comput."},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Russo, J.C., Erickson, K.G., Beard, J.K.: Costas array search technique that maximizes backtrack and symmetry exploitation. In: 44th Annual Conference on Information Sciences and Systems (CISS), pp. 1\u20138. IEEE (2010)","DOI":"10.1109\/CISS.2010.5464772"},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"Schreiber, D., Sanders, P.: Scalable SAT solving in the cloud. In: Theory and Applications of Satisfiability Testing - SAT 2021 (2021)","DOI":"10.1007\/978-3-030-80223-3_35"},{"key":"6_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1007\/11889205_46","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"T Walsh","year":"2006","unstructured":"Walsh, T.: General symmetry breaking constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 650\u2013664. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889205_46"},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Wieringa, S., Heljanko, K.: Concurrent clause strengthening. In: Theory and Applications of Satisfiability Testing - SAT 2013 (2013)","DOI":"10.1007\/978-3-642-39071-5_10"},{"key":"6_CR38","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. 32, 565\u2013606 (2008)","journal-title":"J. Artif. Intell. Res."}],"container-title":["Lecture Notes in Computer Science","PRICAI 2022: Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20862-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,3]],"date-time":"2022-11-03T23:30:08Z","timestamp":1667518208000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20862-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031208614","9783031208621"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20862-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"4 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific Rim International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shangai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pricai2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pricai.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"432","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":"91","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":"39","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":"21% - 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":"7-8","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":"n\/a","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)"}}]}}