{"id":"https://openalex.org/W3208299552","doi":"https://doi.org/10.4230/lipics.cp.2021.47","title":"Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms","display_name":"Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3208299552","doi":"https://doi.org/10.4230/lipics.cp.2021.47","mag":"3208299552"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:15338","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.47","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol210-cp2021/LIPIcs.CP.2021.47/LIPIcs.CP.2021.47.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol210-cp2021/LIPIcs.CP.2021.47/LIPIcs.CP.2021.47.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056056607","display_name":"Alexander Semenov","orcid":"https://orcid.org/0000-0001-6172-4801","observed_orcids":["https://orcid.org/0000-0001-6172-4801"]},"institutions":[{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]},{"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":"Semenov, Alexander","raw_affiliation_strings":["ITMO University, St. Petersburg, Russia","St Petersburg University, Saint Petersburg, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ITMO University, St. Petersburg, Russia","institution_ids":["https://openalex.org/I173089394"]},{"raw_affiliation_string":"St Petersburg University, Saint Petersburg, Russia","institution_ids":["https://openalex.org/I172901346"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062429578","display_name":"\u0427\u0438\u0432\u0438\u043b\u0438\u0445\u0438\u043d \u0414\u0430\u043d\u0438\u0438\u043b \u0421\u0435\u0440\u0433\u0435\u0435\u0432\u0438\u0447","orcid":"https://orcid.org/0000-0002-6417-6254","observed_orcids":["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":"Chivilikhin, Daniil","raw_affiliation_strings":["ITMO University, St. Petersburg, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ITMO University, St. Petersburg, Russia","institution_ids":["https://openalex.org/I173089394"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053808600","display_name":"Artem Pavlenko","orcid":"https://orcid.org/0000-0002-3812-4880","observed_orcids":["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":false,"raw_author_name":"Pavlenko, Artem","raw_affiliation_strings":["ITMO University, St. Petersburg, Russia","JetBrains Research, St. Petersburg, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ITMO University, St. Petersburg, Russia","institution_ids":["https://openalex.org/I173089394"]},{"raw_affiliation_string":"JetBrains Research, St. Petersburg, Russia","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072440973","display_name":"Ilya V. Otpuschennikov","orcid":"https://orcid.org/0000-0001-5209-1803","observed_orcids":["https://orcid.org/0000-0001-5209-1803"]},"institutions":[{"id":"https://openalex.org/I1313323035","display_name":"Russian Academy of Sciences","ror":"https://ror.org/05qrfxd25","country_code":"RU","type":"government","lineage":["https://openalex.org/I1313323035"]},{"id":"https://openalex.org/I4210127387","display_name":"Siberian Branch of the Russian Academy of Sciences","ror":"https://ror.org/02frkq021","country_code":"RU","type":"government","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210127387"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Otpuschennikov, Ilya","raw_affiliation_strings":["ISDCT SB RAS, Irkutsk, Russia","Russian Academy of Sciences, Moscow, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ISDCT SB RAS, Irkutsk, Russia","institution_ids":["https://openalex.org/I1313323035","https://openalex.org/I4210127387"]},{"raw_affiliation_string":"Russian Academy of Sciences, Moscow, Russia","institution_ids":["https://openalex.org/I1313323035"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047407238","display_name":"\u0423\u043b\u044c\u044f\u043d\u0446\u0435\u0432 \u0412\u043b\u0430\u0434\u0438\u043c\u0438\u0440 \u0418\u0433\u043e\u0440\u0435\u0432\u0438\u0447","orcid":"https://orcid.org/0000-0003-0802-830X","observed_orcids":["https://orcid.org/0000-0003-0802-830X"]},"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":"Ulyantsev, Vladimir","raw_affiliation_strings":["ITMO University, St. Petersburg, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ITMO University, St. Petersburg, Russia","institution_ids":["https://openalex.org/I173089394"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051305025","display_name":"Alexey Ignatiev","orcid":"https://orcid.org/0000-0002-4535-2902","observed_orcids":["https://orcid.org/0000-0002-4535-2902"]},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Ignatiev, Alexey","raw_affiliation_strings":["Monash University, Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Monash University, Melbourne, Australia","institution_ids":["https://openalex.org/I56590836"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4349,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.60199897,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.975600004196167,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.975600004196167,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.00930000003427267,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.005499999970197678,"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/propositional-satisfiability","display_name":"propositional satisfiability","score":0.9290000200271606},{"id":"https://openalex.org/keywords/cnf-formulas","display_name":"CNF formulas","score":0.7429999709129333},{"id":"https://openalex.org/keywords/pseudo-boolean-optimization","display_name":"pseudo-Boolean optimization","score":0.7839999794960022},{"id":"https://openalex.org/keywords/black-box-optimization","display_name":"black-box optimization","score":0.8379999995231628},{"id":"https://openalex.org/keywords/evolutionary-algorithms","display_name":"evolutionary algorithms","score":0.7760000228881836},{"id":"https://openalex.org/keywords/unsatisfiable-formulas","display_name":"unsatisfiable formulas","score":0.8159999847412109},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.7509999871253967}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5803511142730713},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5289697051048279},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.4840247333049774},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4820024073123932},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.43079710006713867},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.320745050907135},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25377848744392395},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22250938415527344}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:15338","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.47","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol210-cp2021/LIPIcs.CP.2021.47/LIPIcs.CP.2021.47.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"pmh:oai:monash.edu:openaire/dc8cfb70-d2f8-4b0e-9ed6-fc14abc7910d","doi":null,"is_oa":true,"landing_page_url":"https://research.monash.edu/en/publications/dc8cfb70-d2f8-4b0e-9ed6-fc14abc7910d","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"doi:10.4230/lipics.cp.2021.47","doi":"https://doi.org/10.4230/lipics.cp.2021.47","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.cp.2021.47","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj","jufo-1","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"mag:3208299552","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/cp/cp2021.html#SemenovCPOUI21","pdf_url":null,"source":{"id":"https://openalex.org/S4306420726","display_name":"Principles and Practice of Constraint Programming","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Principles and Practice of Constraint Programming","raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:15338","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.47","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol210-cp2021/LIPIcs.CP.2021.47/LIPIcs.CP.2021.47.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320331675","display_name":"JetBrains Research","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3208299552.pdf","grobid_xml":"https://content.openalex.org/works/W3208299552.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4389982861","https://openalex.org/W7098402577","https://openalex.org/W4387012496","https://openalex.org/W2367055697","https://openalex.org/W1594550269","https://openalex.org/W4283790218","https://openalex.org/W2376287672","https://openalex.org/W7097696988","https://openalex.org/W2353485967","https://openalex.org/W3135025837"],"abstract_inverted_index":{"Propositional":[0],"satisfiability":[1],"(SAT)":[2],"solvers":[3],"are":[4],"deemed":[5],"to":[6,44,71,93,105,129,162,173,184],"be":[7],"among":[8],"the":[9,28,41,46,72,95,98,106,109,115,130,137,150,156],"most":[10],"efficient":[11],"reasoners,":[12],"which":[13,65,154],"have":[14,37],"been":[15,38],"successfully":[16],"used":[17,92],"in":[18,40,51,68,79,87],"a":[19,33,60,88,165],"wide":[20],"range":[21],"of":[22,31,35,48,85,97,118,125,147,152,164,179,189],"practical":[23],"applications.":[24],"As":[25],"this":[26,101,135,174],"contrasts":[27],"well-known":[29],"NP-completeness":[30],"SAT,":[32],"number":[34],"attempts":[36],"made":[39],"recent":[42],"past":[43],"assess":[45],"hardness":[47,63,96,158],"propositional":[49],"formulas":[50,120],"conjunctive":[52],"normal":[53],"form":[54],"(CNF).":[55],"The":[56,145],"present":[57],"paper":[58,138],"proposes":[59],"CNF":[61,89,119,191],"formula":[62,90,99],"measure":[64,111,136],"is":[66,91,160],"close":[67],"conceptual":[69],"meaning":[70],"one":[73],"based":[74],"on":[75],"Backdoor":[76],"set":[77],"notion:":[78],"both":[80],"cases":[81],"some":[82],"subset":[83,151],"B":[84,128],"variables":[86,126,153],"define":[94],"w.r.t.":[100],"set.":[102],"In":[103],"contrast":[104],"backdoor":[107],"measure,":[108],"new":[110],"does":[112],"not":[113],"demand":[114],"polynomial":[116],"decidability":[117],"obtained":[121],"when":[122],"substituting":[123],"assignments":[124],"from":[127,186],"original":[131],"formula.":[132],"To":[133],"estimate":[134],"suggests":[139],"an":[140],"adaptive":[141],"(\u03b5,\u03b4)-approximation":[142],"probabilistic":[143],"algorithm.":[144],"problem":[146,175],"looking":[148],"for":[149],"provides":[155],"minimal":[157],"value":[159],"reduced":[161],"optimization":[163],"pseudo-Boolean":[166],"black-box":[167],"function.":[168],"We":[169],"apply":[170],"evolutionary":[171],"algorithms":[172],"and":[176,182],"demonstrate":[177],"applicability":[178],"proposed":[180],"notions":[181],"techniques":[183],"tests":[185],"several":[187],"families":[188],"unsatisfiable":[190],"formulas.":[192]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2}],"updated_date":"2026-11-13T13:42:25.865203","created_date":"2021-11-08T00:00:00"}