{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T05:48:50Z","timestamp":1761976130763,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031765537"},{"type":"electronic","value":"9783031765544"}],"license":[{"start":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T00:00:00Z","timestamp":1731456000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T00:00:00Z","timestamp":1731456000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-76554-4_17","type":"book-chapter","created":{"date-parts":[[2024,11,12]],"date-time":"2024-11-12T11:17:58Z","timestamp":1731410278000},"page":"288-296","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improving SAT Solver Performance Through MLP-Predicted Genetic Algorithm Parameters"],"prefix":"10.1007","author":[{"given":"Sabrine","family":"Saouli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Souheib","family":"Baarir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude","family":"Dutheillet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,13]]},"reference":[{"issue":"2","key":"17_CR1","first-page":"33","volume":"3","author":"U Aiman","year":"2015","unstructured":"Aiman, U., Asrar, N.: Genetic algorithm based solution to sat-3 problem. J. Comput. Sci. Appl. 3(2), 33\u201339 (2015)","journal-title":"J. Comput. Sci. Appl."},{"key":"17_CR2","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern sat solvers. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 399\u2013404 (2009)"},{"key":"17_CR3","unstructured":"Balyo, T., Heule, M., Iser, M., J\u00e4rvisalo, M., Suda, M.: Proceedings of sat competition 2023: solver, benchmark and proof checker descriptions (2023)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Benhamou, B., Nabhani, T., Ostrowski, R., Sa\u00efdi, M.R.: Enhancing clause learning by symmetry in sat solvers. In: 2010 22nd IEEE International Conference on Tools with Artificial Intelligence, vol.\u00a01, pp. 329\u2013335. IEEE (2010)","DOI":"10.1109\/ICTAI.2010.55"},{"key":"17_CR5","unstructured":"Biere, A.: CaDiCaL, Lingeling, plingeling, treengeling, YalSAT entering the SAT competition 2017. In: Balyo, T., Heule, M., J\u00e4rvisalo, M. (eds.) Proceedings of the SAT Competition 2017\u2014Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B, vol. B-2017-1, pp. 14\u201315. University of Helsinki (2017)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/BFb0058022","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"EM Clarke","year":"1997","unstructured":"Clarke, E.M.: Model checking. In: Ramesh, S., Sivakumar, G. (eds.) FSTTCS 1997. LNCS, vol. 1346, pp. 54\u201356. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0058022"},{"key":"17_CR7","unstructured":"Duan, H., Nejati, S., Trimponias, G., Poupart, P., Ganesh, V.: Online bayesian moment matching based sat solver heuristics. In: International Conference on Machine Learning. pp. 2710\u20132719. PMLR (2020)"},{"key":"17_CR8","doi-asserted-by":"publisher","unstructured":"Gupta, A., Ganai, M.K., Wang, C.: Sat-based verification methods and applications in hardware verification. In: Bernardo, M., Cimatti, A. (eds.) Formal Methods for Hardware Verification, pp. 108\u2013143. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11757283_5","DOI":"10.1007\/11757283_5"},{"key":"17_CR9","unstructured":"Hall, M.A.: Correlation-based feature selection for machine learning. Ph.D. thesis, The University of Waikato (1999)"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-25566-3_40","volume-title":"Learning and Intelligent Optimization","author":"F Hutter","year":"2011","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 507\u2013523. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25566-3_40"},{"key":"17_CR11","doi-asserted-by":"publisher","unstructured":"Iser, M., Sinz, C.: A problem meta-data library for research in sat. In: Berre, D.L., J\u00e4rvisalo, M. (eds.) Proceedings of Pragmatics of SAT 2015 and 2018. EPiC Series in Computing, vol.\u00a059, pp. 144\u2013152. EasyChair (2019). https:\/\/doi.org\/10.29007\/gdbb","DOI":"10.29007\/gdbb"},{"key":"17_CR12","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)"},{"issue":"1","key":"17_CR13","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10462-011-9230-1","volume":"42","author":"S Kotsiantis","year":"2011","unstructured":"Kotsiantis, S.: Feature selection for machine learning classification problems: a recent overview. Artif. Intell. Rev. 42(1), 157\u2013176 (2011)","journal-title":"Artif. Intell. Rev."},{"key":"17_CR14","unstructured":"Liang, J.H., Oh, C., Ganesh, V., Czarnecki, K., Poupart, P.: Maple-comsps, maplecomsps lrb, maplecomsps chb. In: Proceedings of SAT Competition 2016 (2016)"},{"issue":"1","key":"17_CR15","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":"17_CR16","doi-asserted-by":"publisher","unstructured":"Saouli, S., Baarir, S., Dutheillet, C.: Tackling the\u00a0polarity initialization problem in\u00a0sat solving using a\u00a0genetic algorithm. In: Benz, N., Gopinath, D., Shi, N. (eds.) NFM 2024, pp. 21\u201336. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-60698-4_2","DOI":"10.1007\/978-3-031-60698-4_2"},{"key":"17_CR17","unstructured":"Selman, B., Kautz, H.A.: An empirical study of greedy local search for satisfiability testing. In: AAAI, vol.\u00a093, pp. 46\u201351 (1993)"},{"key":"17_CR18","unstructured":"Silva, J.P.M., Sakallah, K.A.: Grasp-a new search algorithm for satisfiability. In: Proceedings of the 16th IEEE\/ACM International Conference on Computer-Aided Design (ICCAD), pp. 220\u2013227. IEEE (1997)"},{"key":"17_CR19","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","Integrated Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-76554-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T11:38:31Z","timestamp":1737200311000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-76554-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,13]]},"ISBN":["9783031765537","9783031765544"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-76554-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,11,13]]},"assertion":[{"value":"13 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integrated Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Manchester","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2024","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":"ifm2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ifm2024.cs.manchester.ac.uk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}