{"id":"https://openalex.org/W4401416125","doi":"https://doi.org/10.1109/cec60901.2024.10611818","title":"Using Island Model in Asynchronous Evolutionary Strategy to Search for Backdoors for SAT","display_name":"Using Island Model in Asynchronous Evolutionary Strategy to Search for Backdoors for SAT","publication_year":2024,"publication_date":"2024-06-30","ids":{"openalex":"https://openalex.org/W4401416125","doi":"https://doi.org/10.1109/cec60901.2024.10611818"},"language":"en","primary_location":{"id":"doi:10.1109/cec60901.2024.10611818","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/cec60901.2024.10611818","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053808600","display_name":"Artem Pavlenko","orcid":"https://orcid.org/0000-0002-3812-4880"},"institutions":[{"id":"https://openalex.org/I173089394","display_name":"ITMO University","ror":"https://ror.org/04txgxn49","country_code":"RU","type":"education","lineage":["https://openalex.org/I173089394"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Artem Pavlenko","raw_affiliation_strings":["ITMO University,Saint Petersburg,Russia"],"affiliations":[{"raw_affiliation_string":"ITMO University,Saint Petersburg,Russia","institution_ids":["https://openalex.org/I173089394"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056056607","display_name":"Alexander Semenov","orcid":"https://orcid.org/0000-0001-6172-4801"},"institutions":[{"id":"https://openalex.org/I173089394","display_name":"ITMO University","ror":"https://ror.org/04txgxn49","country_code":"RU","type":"education","lineage":["https://openalex.org/I173089394"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Alexander Semenov","raw_affiliation_strings":["ITMO University,Saint Petersburg,Russia"],"affiliations":[{"raw_affiliation_string":"ITMO University,Saint Petersburg,Russia","institution_ids":["https://openalex.org/I173089394"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5053808600"],"corresponding_institution_ids":["https://openalex.org/I173089394"],"apc_list":null,"apc_paid":null,"fwci":0.3663,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.59887687,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"336","issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9879000186920166,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9854999780654907,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7259336709976196},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6927345395088196},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4647471308708191},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4479585587978363},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3845069408416748},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.156605064868927}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7259336709976196},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6927345395088196},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4647471308708191},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4479585587978363},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3845069408416748},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.156605064868927}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec60901.2024.10611818","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/cec60901.2024.10611818","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/14","score":0.5600000023841858,"display_name":"Life below water"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W133371706","https://openalex.org/W203718333","https://openalex.org/W569769073","https://openalex.org/W1528837436","https://openalex.org/W1553838525","https://openalex.org/W1559927413","https://openalex.org/W1595428830","https://openalex.org/W1607589803","https://openalex.org/W1709155369","https://openalex.org/W1732327014","https://openalex.org/W2027605646","https://openalex.org/W2069767473","https://openalex.org/W2086971834","https://openalex.org/W2140132043","https://openalex.org/W2165220807","https://openalex.org/W2170769481","https://openalex.org/W2181647217","https://openalex.org/W2809729522","https://openalex.org/W2888871578","https://openalex.org/W3126185111","https://openalex.org/W3137779645","https://openalex.org/W3208299552","https://openalex.org/W4283790218","https://openalex.org/W4299432846","https://openalex.org/W4382240205","https://openalex.org/W6605457611","https://openalex.org/W6608238736","https://openalex.org/W6633493515","https://openalex.org/W6637371358","https://openalex.org/W6657579752","https://openalex.org/W6679878532","https://openalex.org/W6759350937","https://openalex.org/W6803126404"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2116677773","https://openalex.org/W2155261584","https://openalex.org/W2019305010","https://openalex.org/W4289687320","https://openalex.org/W2116366046","https://openalex.org/W925418074","https://openalex.org/W2119610731","https://openalex.org/W2584195379"],"abstract_inverted_index":{"In":[0,32,104],"this":[1,113,138],"paper":[2],"we":[3,34,108],"propose":[4],"new":[5],"evolutionary":[6],"algorithms":[7],"for":[8,43,45,62,132],"finding":[9,53],"the":[10,22,36,50,66,69,92,101,105,110,117,126,143],"so-called":[11],"backdoors":[12,119],"-":[13],"special":[14],"structures":[15],"that":[16,77],"make":[17],"it":[18,78],"possible":[19],"to":[20,120],"simplify":[21],"solving":[23],"of":[24,30,52,55,83,94,112,128,140],"combinatorial":[25],"problems":[26],"expressed":[27],"as":[28],"systems":[29],"constraints.":[31],"particular,":[33],"consider":[35],"Boolean":[37,46,81,133],"satisfiability":[38],"problem":[39,51],"(SAT)":[40],"and":[41,59],"search":[42],"\u03c1-backdoors":[44,54],"formulas.":[47],"We":[48],"analyze":[49],"small":[56],"fixed":[57,84],"size":[58],"adapt":[60],"(1+1)-EA":[61],"its":[63],"solving:":[64],"in":[65,73,91],"proposed":[67,87],"algorithm":[68,88,114],"mutation":[70],"is":[71],"performed":[72],"such":[74],"a":[75,95],"way":[76],"transitions":[79],"between":[80],"vectors":[82],"weight.":[85],"The":[86],"was":[89],"implemented":[90],"context":[93],"parallel":[96],"asynchronous":[97],"strategy":[98],"based":[99],"on":[100,137],"island":[102],"paradigm.":[103],"experimental":[106],"part":[107],"demonstrate":[109],"applicability":[111],"by":[115],"using":[116],"found":[118],"solve":[121],"extremely":[122],"hard":[123],"instances":[124],"from":[125],"area":[127],"Logical":[129],"Equivalence":[130],"Checking":[131],"circuits:":[134],"our":[135],"approach":[136],"class":[139],"benchmarks":[141],"outperforms":[142],"best":[144],"state-of-the-art":[145],"SAT":[146],"solvers.":[147]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-12-23T23:11:35.936235","created_date":"2025-10-10T00:00:00"}