{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T12:34:21Z","timestamp":1730205261011,"version":"3.28.0"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,6,30]],"date-time":"2024-06-30T00:00:00Z","timestamp":1719705600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,6,30]],"date-time":"2024-06-30T00:00:00Z","timestamp":1719705600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,6,30]]},"DOI":"10.1109\/cec60901.2024.10611818","type":"proceedings-article","created":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T17:55:15Z","timestamp":1723139715000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["Using Island Model in Asynchronous Evolutionary Strategy to Search for Backdoors for SAT"],"prefix":"10.1109","author":[{"given":"Artem","family":"Pavlenko","sequence":"first","affiliation":[{"name":"ITMO University,Saint Petersburg,Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Semenov","sequence":"additional","affiliation":[{"name":"ITMO University,Saint Petersburg,Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Handbook of Satisfiability - Second Edition, ser. Frontiers in Artificial Intelligence and Applications","volume":"336","author":"Biere","year":"2021"},{"key":"ref2","first-page":"1173","article-title":"Backdoors to typical case complexity","author":"Williams","year":"2003","journal-title":"IJCAI"},{"key":"ref3","first-page":"256","article-title":"Tradeoffs in the complexity of back door detection","volume":"4741","author":"Dilkina","year":"2007","journal-title":"CP, ser. LNCS"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01929-6_6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-014-9407-9"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s13748-021-00234-6"},{"issue":"1\u20133","key":"ref7","first-page":"73","article-title":"Backdoor sets for DLL subsolvers","volume":"35","author":"Szeider","year":"2005","journal-title":"J. Autom. Reason."},{"key":"ref8","article-title":"Detecting backdoor sets with respect to horn and binary clauses","author":"Nishimura","year":"2004","journal-title":"SAT"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30891-8_15"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39071-5_29"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i9.21277"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0027170"},{"volume-title":"Symbolic logic and mechanical theorem proving, ser. Computer science classics","year":"1973","author":"Chang","key":"ref13"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"133","DOI":"10.3233\/FAIA200987","article-title":"Conflict-driven clause learning SAT solvers","volume-title":"Handbook of Satisfiability - Second Edition, ser. FAIA","volume":"336","author":"Marques-Silva","year":"2021"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90144-6"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25525"},{"key":"ref17","first-page":"363","article-title":"Backdoor trees","author":"Samer","year":"2008","journal-title":"AAAI"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2002.804386"},{"volume-title":"Equivalence Checking of Digital Circuits: Fundamentals, Principles, Methods","year":"2004","author":"Molitor","key":"ref19"},{"key":"ref20","first-page":"47:1","article-title":"Evaluating the hardness of SAT instances using evolutionary optimization algorithms","volume":"210","author":"Semenov","year":"2021","journal-title":"CP, ser. LIPIcs"},{"key":"ref21","first-page":"15","article-title":"How genetic algorithms really work: Mutation and hillclimbing","author":"M\u00fchlenbein","year":"1992","journal-title":"PPSN"},{"key":"ref22","volume-title":"An Introduction to probability theory and its applications","volume":"2","author":"Feller","year":"1971"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"issue":"1","key":"ref24","first-page":"33","article-title":"The island model genetic algorithm: On separability, population size and convergence","volume":"7","author":"Whitley","year":"1999","journal-title":"Journal of computing and information technology"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2015.10.005"},{"volume-title":"Essentials of Metaheuristics","year":"2013","author":"Luke","key":"ref26"},{"key":"ref27","first-page":"115","article-title":"On the complexity of derivation in propositional calcu-lus","volume-title":"Studies in Constructive Mathematics and Mathematical Logic, Part II, Seminars in mathematics","author":"Tseitin"},{"volume-title":"Introduction to Algorithms","year":"1989","author":"Cormen","key":"ref28"},{"issue":"5","key":"ref29","first-page":"349","article-title":"Some schemes for parallel multipliers","volume":"34","author":"Dadda","year":"1965","journal-title":"Alta Frequenza"},{"volume-title":"The Art of Computer Programming, Volume 2: Seminumerical Algorithms, ser. Addison-Wesley Series in Computer Science & Information Processing","year":"1969","author":"Knuth","key":"ref30"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_5"},{"key":"ref32","first-page":"51","article-title":"CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT Competition 2020","volume-title":"Proc. of SAT Competition 2020 - Solver and Benchmark Descriptions, ser. Department of Computer Science Report Series B","volume":"B-2020-1","author":"Biere"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-94144-8_26"}],"event":{"name":"2024 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2024,6,30]]},"location":"Yokohama, Japan","end":{"date-parts":[[2024,7,5]]}},"container-title":["2024 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10609966\/10611750\/10611818.pdf?arnumber=10611818","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T04:21:39Z","timestamp":1723350099000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10611818\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,30]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/cec60901.2024.10611818","relation":{},"subject":[],"published":{"date-parts":[[2024,6,30]]}}}