{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:50:14Z","timestamp":1762325414618,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031164736"},{"type":"electronic","value":"9783031164743"}],"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-16474-3_55","type":"book-chapter","created":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T14:16:28Z","timestamp":1662992188000},"page":"676-687","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A MaxSAT Solver Based on\u00a0Differential Evolution (Preliminary Report)"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Framil","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Cabalar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Santos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,13]]},"reference":[{"unstructured":"DeMaxSAT Solver (2021). https:\/\/github.com\/Manuframil\/DEMaxSatSolver","key":"55_CR1"},{"doi-asserted-by":"crossref","unstructured":"Ali, H.M., Mitchell, D., Lee, D.C.: MAX-SAT problem using evolutionary algorithms. In: 2014 IEEE Symposium on Swarm Intelligence, pp. 1\u20138 (2014)","key":"55_CR2","DOI":"10.1109\/SIS.2014.7011783"},{"unstructured":"Bacchus, F., J\u00e4rvisalo, M., Berg, J., Martins, R.: MaxSAT evaluation (2021). https:\/\/maxsat-evaluations.github.io\/2021\/","key":"55_CR3"},{"unstructured":"Berg, J., Demirovic, E., Stuckey, P.: Loandra in the 2020 MaxSAT evaluation (2020). https:\/\/helda.helsinki.fi\/bitstream\/handle\/10138\/333649\/mse21proc.pdf","key":"55_CR4"},{"issue":"4","key":"55_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. Tech. Eng. Syst. J. 2(4), 115\u2013120 (2017)","journal-title":"Adv. Sci. Tech. Eng. Syst. J."},{"key":"55_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10852-008-9077-x","volume":"7","author":"D Boughaci","year":"2008","unstructured":"Boughaci, D., Benhamou, B., Drias, H.: Scatter search and genetic algorithms for MAX-SAT problems. J. Math. Model Algor. 7, 101\u2013124 (2008). https:\/\/doi.org\/10.1007\/s10852-008-9077-x","journal-title":"J. Math. Model Algor."},{"doi-asserted-by":"crossref","unstructured":"Chen, W., Whitley, D., Tin\u00f3s, R., Chicano, F.: Tunneling between plateaus: improving on a state-of-the-art MAXSAT solver using partition crossover. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, 15\u201319 July (2018)","key":"55_CR7","DOI":"10.1145\/3205455.3205482"},{"key":"55_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2016.01.004","volume":"27","author":"S Das","year":"2016","unstructured":"Das, S., Mullick, S., Suganthan, P.: Recent advances in differential evolution - an updated survey. Swarm Evol. Comput. 27, 1\u201330 (2016)","journal-title":"Swarm Evol. Comput."},{"issue":"9","key":"55_CR9","doi-asserted-by":"publisher","first-page":"3095","DOI":"10.1007\/s00500-017-2956-1","volume":"23","author":"Y Djenouri","year":"2017","unstructured":"Djenouri, Y., Habbas, Z., Djenouri, D., Fournier-Viger, P.: Bee swarm optimization for solving the MAXSAT problem using prior knowledge. Soft. Comput. 23(9), 3095\u20133112 (2017). https:\/\/doi.org\/10.1007\/s00500-017-2956-1","journal-title":"Soft. Comput."},{"key":"55_CR10","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.tcs.2019.08.025","volume":"801","author":"B Doerr","year":"2020","unstructured":"Doerr, B., Zheng, W.: Working principles of binary differential evolution. Theoret. Comput. Sci. 801, 110\u2013142 (2020)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"55_CR11","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1515\/jisys-2016-0129","volume":"27","author":"IA Doush","year":"2018","unstructured":"Doush, I.A., Quran, A.L., Al-Betar, M.A., Awadallah, M.A.: MAX-SAT problem using hybrid harmony search algorithm. J. Intell. Syst. 27(4), 643\u2013658 (2018)","journal-title":"J. Intell. Syst."},{"issue":"1","key":"55_CR12","doi-asserted-by":"publisher","first-page":"402","DOI":"10.2991\/ijcis.11.1.30","volume":"11","author":"H Fu","year":"2018","unstructured":"Fu, H., Xu, Y., Wu, G., Jia, H., Zhang, W., Hu, R.: An improved adaptive genetic algorithm for solving 3-SAT problems based on effective restart and greedy strategy. Int. J. Comput. Intell. Syst. 11(1), 402\u2013413 (2018)","journal-title":"Int. J. Comput. Intell. Syst."},{"unstructured":"Joshi, S., Kumar, P., Rao, S., Martins, R.: Open-WBO-Inc in MaxSAT evaluation 2020 (2020). https:\/\/helda.helsinki.fi\/bitstream\/handle\/10138\/333649\/mse21proc.pdf","key":"55_CR13"},{"key":"55_CR14","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1162\/evco.2006.14.2.223","volume":"14","author":"F Lardeux","year":"2006","unstructured":"Lardeux, F., Saubion, F., Hao, J.K.: GASAT: a genetic local search algorithm for the satisfiability problem. Evol. Comput. 14, 223\u201353 (2006)","journal-title":"Evol. Comput."},{"unstructured":"Lei, Z., et al.: SATLike-c: solver description (2021). https:\/\/helda.helsinki.fi\/bitstream\/handle\/10138\/333649\/mse21proc.pdf","key":"55_CR15"},{"doi-asserted-by":"crossref","unstructured":"Lov\u00ed\u0161kov\u00e1, J.: Solving the 3-SAT problem using genetic algorithms. In: INES 2015 - IEEE 19th International Conference on Intelligent Engineering Systems, pp. 207\u2013212 (2015)","key":"55_CR16","DOI":"10.1109\/INES.2015.7329708"},{"key":"55_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/3-540-45034-3_60","volume-title":"Developments in Applied Artificial Intelligence","author":"ME Menai","year":"2003","unstructured":"Menai, M.E., Batouche, M.: efficient initial solution to extremal optimization algorithm for weighted MAXSAT problem. In: Chung, P.W.H., Hinde, C., Ali, M. (eds.) IEA\/AIE 2003. LNCS (LNAI), vol. 2718, pp. 592\u2013603. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45034-3_60"},{"unstructured":"Nadel, A.: Tt-Open-WBO-Inc-21: an anytime MaxSAT solver entering MSE 2021 (2020). https:\/\/helda.helsinki.fi\/bitstream\/handle\/10138\/333649\/mse21proc.pdf","key":"55_CR18"},{"key":"55_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2011.11.003","volume":"2","author":"F Neri","year":"2012","unstructured":"Neri, F., Cotta, C.: Memetic algorithms and memetic computing optimization: a literature review. Swarm Evol. Comput. 2, 1\u201314 (2012)","journal-title":"Swarm Evol. Comput."},{"unstructured":"Reisch, J., Gro\u00dfmann, P.: Stable Resolving (2020). https:\/\/helda.helsinki.fi\/bitstream\/handle\/10138\/333649\/mse21proc.pdf","key":"55_CR20"},{"unstructured":"Selman, B., Kautz, H.A.: Domain-independent extensions to GSAT: solving large structured satisfiability problems. In: Proccedings of the IJCAI-93, pp. 290\u2013295 (1993)","key":"55_CR21"},{"unstructured":"Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proceedings of the AAAI Conference, pp. 440\u2013446. AAAI Press (1992)","key":"55_CR22"},{"key":"55_CR23","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11, 341\u2013359 (1997)","journal-title":"J. Global Optim."}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16474-3_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T14:24:51Z","timestamp":1662992691000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16474-3_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031164736","9783031164743"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16474-3_55","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":"13 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EPIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"EPIA Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"31 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"epia2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/epia2022.inesc-id.pt\/","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":"85","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":"64","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":"0","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":"75% - 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":"3,7","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":"0,9","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)"}}]}}