{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:34:55Z","timestamp":1742913295417,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031606977"},{"type":"electronic","value":"9783031606984"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-60698-4_2","type":"book-chapter","created":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T00:01:51Z","timestamp":1716768111000},"page":"21-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Tackling the\u00a0Polarity Initialization Problem in\u00a0SAT Solving Using a\u00a0Genetic Algorithm"],"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,5,26]]},"reference":[{"issue":"2","key":"2_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":"2_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":"2_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":"2_CR4","unstructured":"Balyo, T., Heule, M.J., Iser, M., J\u00e4rvisalo, M., Suda, M.: SAT competition 2022 (2022)"},{"issue":"4","key":"2_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.25046\/aj020416","volume":"2","author":"A Bhattacharjee","year":"2017","unstructured":"Bhattacharjee, A., Chauhan, P.: Solving the SAT problem using genetic algorithm. Adv. Sci. Technol. Eng. Syst 2(4), 115\u2013120 (2017)","journal-title":"Adv. Sci. Technol. Eng. Syst"},{"key":"2_CR6","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.) Proceedings\u00a0of SAT Competition 2020 \u2013 Solver and Benchmark Descriptions. Department of Computer Science Report Series B, vol. B-2020-1, pp. 51\u201353. University of Helsinki (2020)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Boughaci, D., Drias, H., Benhamou, B., et\u00a0al.: Combining a unit propagation with genetic algorithms to solve Max-SAT problems (2008)","DOI":"10.1007\/s10852-008-9077-x"},{"issue":"2","key":"2_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":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-24318-4_1","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"S Cai","year":"2015","unstructured":"Cai, S., Luo, C., Su, K.: CCAnr: a configuration checking based local search solver for non-random satisfiability. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 1\u20138. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24318-4_1"},{"key":"2_CR10","unstructured":"Cai, S., Luo, C., Zhang, X., Zhang, J.: Improving local search for structured SAT formulas via unit propagation based construct and cut initialization (short paper). In: 27th International Conference on Principles and Practice of Constraint Programming (CP 2021) (2021)"},{"issue":"7","key":"2_CR11","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Commun. ACM 5(7), 394\u2013397 (1962)","journal-title":"Commun. ACM"},{"key":"2_CR12","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":"2_CR13","doi-asserted-by":"crossref","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: International Conference on Theory and Applications of Satisfiability Testing (2003)","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"2_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103572","volume":"301","author":"N Froleyks","year":"2021","unstructured":"Froleyks, N., Heule, M., Iser, M., J\u00e4rvisalo, M., Suda, M.: SAT competition 2020. Artif. Intell. 301, 103572 (2021)","journal-title":"Artif. Intell."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Fu, H., Xu, Y., Wu, G., Ning, X.: An improved genetic algorithm for solving 3-SAT problems based on effective restart and greedy strategy. In: 2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE), pp.\u00a01\u20136. IEEE (2017)","DOI":"10.1109\/ISKE.2017.8258797"},{"key":"2_CR16","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1090.001.0001","volume-title":"Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence","author":"JH Holland","year":"1992","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. MIT Press, Cambridge (1992)"},{"key":"2_CR17","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"},{"issue":"4","key":"2_CR18","first-page":"333","volume":"3","author":"K Jebari","year":"2013","unstructured":"Jebari, K., Madiafi, M., et al.: Selection methods for genetic algorithms. Int. J. Emerg. Sci. 3(4), 333\u2013344 (2013)","journal-title":"Int. J. Emerg. Sci."},{"issue":"1\u20134","key":"2_CR19","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01531077","volume":"1","author":"RG Jeroslow","year":"1990","unstructured":"Jeroslow, R.G., Wang, J.: Solving propositional satisfiability problems. Ann. Math. Artif. Intell. 1(1\u20134), 167\u2013187 (1990)","journal-title":"Ann. Math. Artif. Intell."},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","volume":"80","author":"S Katoch","year":"2021","unstructured":"Katoch, S., Chauhan, S.S., Kumar, V.: A review on genetic algorithm: past, present, and future. Multimed. Tools Appl. 80, 8091\u20138126 (2021)","journal-title":"Multimed. Tools Appl."},{"key":"2_CR21","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)"},{"key":"2_CR22","unstructured":"Marchiori, E., Rossi, C.: A flipping genetic algorithm for hard 3-SAT problems (1999)"},{"key":"2_CR23","unstructured":"Rana, S., Heckendorn, R.B., Whitley, D.: A tractable Walsh analysis of SAT and its implications for genetic algorithms. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 15, pp. 392\u2013397 (1998)"},{"key":"2_CR24","unstructured":"Sami\u00a0Cherif, M., Habet, D., Terrioux, C.: Un bandit manchot pour combiner CHB et VSIDS. In: Actes des 16\u00e8mes Journ\u00e9es Francophones de Programmation par Contraintes (JFPC), Nice, France (2021)"},{"key":"2_CR25","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":"2_CR26","unstructured":"Silva, J.P.M., Sakallah, K.A.: GRASP\u2014a 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":"2_CR27","doi-asserted-by":"crossref","unstructured":"Soon, G.K., Guan, T.T., On, C.K., Alfred, R., Anthony, P.: A comparison on the performance of crossover techniques in video game. In: 2013 IEEE International Conference on Control System, Computing and Engineering. IEEE (2013)","DOI":"10.1109\/ICCSCE.2013.6720015"},{"key":"2_CR28","first-page":"44651","volume":"79","author":"P Springer","year":"2020","unstructured":"Springer, P., Katoch, S.: A review on genetic algorithm: past, present, and future. Multimed. Tools Appl. 79, 44651\u201344681 (2020)","journal-title":"Multimed. Tools Appl."},{"key":"2_CR29","unstructured":"Zhang, X., Cai, S., Chen, Z.: Improving CDCL via local search. In: SAT Competition 2021, p. 42 (2021)"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-60698-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T00:02:09Z","timestamp":1716768129000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60698-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031606977","9783031606984"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60698-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"26 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moffett Field, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"4 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}