{"id":"https://openalex.org/W4294811483","doi":"https://doi.org/10.1109/cec55065.2022.9870262","title":"Asynchronous Evolutionary Algorithm for Finding Backdoors in Boolean Satisfiability","display_name":"Asynchronous Evolutionary Algorithm for Finding Backdoors in Boolean Satisfiability","publication_year":2022,"publication_date":"2022-07-18","ids":{"openalex":"https://openalex.org/W4294811483","doi":"https://doi.org/10.1109/cec55065.2022.9870262"},"language":"en","primary_location":{"id":"doi:10.1109/cec55065.2022.9870262","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec55065.2022.9870262","pdf_url":null,"source":{"id":"https://openalex.org/S4363605353","display_name":"2022 IEEE Congress on Evolutionary Computation (CEC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 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,St. Petersburg,Russia","ITMO University, St. Petersburg, Russia"],"affiliations":[{"raw_affiliation_string":"ITMO University,St. Petersburg,Russia","institution_ids":["https://openalex.org/I173089394"]},{"raw_affiliation_string":"ITMO University, St. Petersburg, Russia","institution_ids":["https://openalex.org/I173089394"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062429578","display_name":"Daniil Chivilikhin","orcid":"https://orcid.org/0000-0002-6417-6254"},"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":"Daniil Chivilikhin","raw_affiliation_strings":["ITMO University,St. Petersburg,Russia","ITMO University, St. Petersburg, Russia"],"affiliations":[{"raw_affiliation_string":"ITMO University,St. Petersburg,Russia","institution_ids":["https://openalex.org/I173089394"]},{"raw_affiliation_string":"ITMO University, St. 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,St. Petersburg,Russia","ITMO University, St. Petersburg, Russia"],"affiliations":[{"raw_affiliation_string":"ITMO University,St. Petersburg,Russia","institution_ids":["https://openalex.org/I173089394"]},{"raw_affiliation_string":"ITMO University, St. Petersburg, Russia","institution_ids":["https://openalex.org/I173089394"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5053808600"],"corresponding_institution_ids":["https://openalex.org/I173089394"],"apc_list":null,"apc_paid":null,"fwci":0.4155,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.57724628,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"185","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9945999979972839,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9886999726295471,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.774341344833374},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6802188754081726},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.6765151023864746},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6649063229560852},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5760725140571594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49868297576904297},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4974108040332794},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4798114597797394},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.46288084983825684},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4516531229019165},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.156503826379776}],"concepts":[{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.774341344833374},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6802188754081726},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.6765151023864746},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6649063229560852},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5760725140571594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49868297576904297},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4974108040332794},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4798114597797394},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.46288084983825684},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4516531229019165},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.156503826379776},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec55065.2022.9870262","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec55065.2022.9870262","pdf_url":null,"source":{"id":"https://openalex.org/S4363605353","display_name":"2022 IEEE Congress on Evolutionary Computation (CEC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W46203810","https://openalex.org/W128869332","https://openalex.org/W1496529478","https://openalex.org/W1530765221","https://openalex.org/W1542449374","https://openalex.org/W1709155369","https://openalex.org/W1732327014","https://openalex.org/W1922664086","https://openalex.org/W2043582016","https://openalex.org/W2094500233","https://openalex.org/W2137408671","https://openalex.org/W2160464614","https://openalex.org/W2166518494","https://openalex.org/W2274099920","https://openalex.org/W2345876752","https://openalex.org/W2401003083","https://openalex.org/W2604934189","https://openalex.org/W2788662016","https://openalex.org/W2809729522","https://openalex.org/W2913079528","https://openalex.org/W2937012869","https://openalex.org/W2968084646","https://openalex.org/W3100251110","https://openalex.org/W3208299552","https://openalex.org/W4237826793","https://openalex.org/W4243857622","https://openalex.org/W4245630182","https://openalex.org/W6601882341","https://openalex.org/W6635300605","https://openalex.org/W6637371358","https://openalex.org/W6679878532","https://openalex.org/W6760930595","https://openalex.org/W6803126404"],"related_works":["https://openalex.org/W2558119813","https://openalex.org/W2486424993","https://openalex.org/W3209970637","https://openalex.org/W3194654861","https://openalex.org/W2212155158","https://openalex.org/W2101101130","https://openalex.org/W2296658079","https://openalex.org/W83935621","https://openalex.org/W1518211069","https://openalex.org/W3095638317"],"abstract_inverted_index":{"In":[0],"this":[1],"work":[2],"we":[3],"propose":[4],"an":[5,43,63],"asynchronous":[6,81],"parallel":[7],"evolutionary":[8],"algorithm":[9,87],"that":[10,61,78],"is":[11,46],"efficient":[12,64],"for":[13,49],"a":[14,33,70],"specific":[15],"type":[16],"of":[17,25,35,41,59,66,72],"gray-box":[18],"optimization":[19,44],"problems,":[20],"in":[21,53],"which":[22],"the":[23,26,47,54,67,79,86],"calculation":[24],"fitness":[27],"function":[28],"may":[29],"be":[30],"split":[31],"into":[32,69],"set":[34,71],"several":[36],"independent":[37,73],"calculations.":[38],"An":[39],"example":[40],"such":[42],"problem":[45,68],"search":[48],"backdoors":[50],"(hidden":[51],"structures)":[52],"Boolean":[55],"satisfiability":[56],"problem:":[57],"subsets":[58],"variables":[60],"allow":[62],"splitting":[65],"subproblems.":[74],"Our":[75],"experiments":[76],"show":[77],"proposed":[80],"approach":[82],"allows":[83],"speeding":[84],"up":[85],"considerably,":[88],"while":[89],"also":[90],"effi-ciently":[91],"utilizing":[92],"comnuting":[93],"cluster":[94],"time.":[95]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}