{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T12:32:37Z","timestamp":1730205157489,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T00:00:00Z","timestamp":1658102400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T00:00:00Z","timestamp":1658102400000},"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":[[2022,7,18]]},"DOI":"10.1109\/cec55065.2022.9870262","type":"proceedings-article","created":{"date-parts":[[2022,9,6]],"date-time":"2022-09-06T19:28:14Z","timestamp":1662492494000},"page":"1-8","source":"Crossref","is-referenced-by-count":3,"title":["Asynchronous Evolutionary Algorithm for Finding Backdoors in Boolean Satisfiability"],"prefix":"10.1109","author":[{"given":"Artem","family":"Pavlenko","sequence":"first","affiliation":[{"name":"ITMO University,St. Petersburg,Russia"}]},{"given":"Daniil","family":"Chivilikhin","sequence":"additional","affiliation":[{"name":"ITMO University,St. Petersburg,Russia"}]},{"given":"Alexander","family":"Semenov","sequence":"additional","affiliation":[{"name":"ITMO University,St. Petersburg,Russia"}]}],"member":"263","reference":[{"key":"ref10","first-page":"47:1","article-title":"Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms","author":"semenov","year":"2021","journal-title":"CP"},{"key":"ref11","first-page":"237","article-title":"Evolutionary computation techniques for constructing SAT-based attacks in algebraic cryptanaly-sis","author":"pavlenko","year":"2019","journal-title":"EvoApplications"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.2307\/2280232"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014803900897"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00076"},{"journal-title":"Parallel Processing and Parallel Algorithms Theory and Computation","year":"2012","author":"roosta","key":"ref15"},{"key":"ref16","volume":"185","author":"biere","year":"2009","journal-title":"Handbook of Satisfiability Ser Frontiers in Artificial Intelligence and Applications"},{"journal-title":"Symbolic Logic and Mechanical Theorem Proving","year":"1973","author":"chang","key":"ref17"},{"key":"ref18","first-page":"115","article-title":"On the complexity of derivation in propositional calcu-lus","author":"tseitin","year":"1970","journal-title":"Studies in Constructive Mathematics and Mathematical Logic Part II Seminars in Mathematics"},{"key":"ref19","first-page":"222","article-title":"Measuring the hardness of SAT instances","author":"ansotegui","year":"2008","journal-title":"AAAI"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2746239"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54013-4_1"},{"key":"ref27","first-page":"8","article-title":"CaDiCaL at the SAT Race 2019","volume":"b 2019 1","author":"biere","year":"2019","journal-title":"Proceedings of SAT Race 2019"},{"key":"ref3","first-page":"457","article-title":"Bounded model checking","author":"biere","year":"2009","journal-title":"Handbook of Satisfiability"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-88757-9"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2019.8790257"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/11814948_16"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40970-2_15"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34188-5_8"},{"key":"ref2","first-page":"505","article-title":"Software verification","author":"kroening","year":"2009","journal-title":"Handbook of Satisfiability"},{"key":"ref9","first-page":"1173","article-title":"Backdoors to typical case complexity","volume":"3","author":"williams","year":"2003","journal-title":"IJCAI"},{"journal-title":"Essentials of Metaheuristics","year":"2015","author":"luke","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30891-8_15"},{"key":"ref22","first-page":"131","article-title":"Conflict-driven clause learning SAT solvers","author":"marques-silva","year":"2009","journal-title":"Handbook of Satisfiability"},{"journal-title":"Grid based propositional satisfiability solving","year":"2011","author":"hyvarinen","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(89)90038-2"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.12205"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-94144-8_26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071301"}],"event":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2022,7,18]]},"location":"Padua, Italy","end":{"date-parts":[[2022,7,23]]}},"container-title":["2022 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9870216\/9870201\/09870262.pdf?arnumber=9870262","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T20:43:30Z","timestamp":1664829810000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9870262\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,18]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/cec55065.2022.9870262","relation":{},"subject":[],"published":{"date-parts":[[2022,7,18]]}}}