{"id":"https://openalex.org/W4389982861","doi":"https://doi.org/10.48550/arxiv.2312.10436","title":"Decomposing Hard SAT Instances with Metaheuristic Optimization","display_name":"Decomposing Hard SAT Instances with Metaheuristic Optimization","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4389982861","doi":"https://doi.org/10.48550/arxiv.2312.10436"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2312.10436","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":["Cornell University"],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false},"type":"preprint","type_crossref":"posted-content","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/abs/2312.10436","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062429578","display_name":"Daniil Chivilikhin","orcid":"https://orcid.org/0000-0002-6417-6254"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chivilikhin, Daniil","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053808600","display_name":"Artem Pavlenko","orcid":"https://orcid.org/0000-0002-3812-4880"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pavlenko, Artem","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5056056607","display_name":"Alexander Semenov","orcid":"https://orcid.org/0000-0001-6172-4801"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Semenov, Alexander","raw_affiliation_strings":[],"affiliations":[]}],"institution_assertions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":67},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10211","display_name":"Computational Drug Discovery Methods","score":0.9353,"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"}},"topics":[{"id":"https://openalex.org/T10211","display_name":"Computational Drug Discovery Methods","score":0.9353,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.8110319},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.71108323},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5386474},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.5158474},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.46042347}],"concepts":[{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.8110319},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.71108323},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5937657},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5864241},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5386474},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5235643},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.5158474},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4959577},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4740588},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.46042347},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44851002},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44106165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4250628},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3940033},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25343496},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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":2,"locations":[{"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2312.10436","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":["Cornell University"],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false},{"is_oa":false,"landing_page_url":"https://api.datacite.org/dois/10.48550/arxiv.2312.10436","pdf_url":null,"source":{"id":"https://openalex.org/S4393179698","display_name":"DataCite API","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210145204","host_organization_name":"DataCite","host_organization_lineage":["https://openalex.org/I4210145204"],"host_organization_lineage_names":["DataCite"],"type":"metadata"},"license":null,"license_id":null,"version":null}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2312.10436","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":["Cornell University"],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4289743389","https://openalex.org/W3152212242","https://openalex.org/W2996462315","https://openalex.org/W2883069340","https://openalex.org/W2486424993","https://openalex.org/W2408080066","https://openalex.org/W2406837904","https://openalex.org/W2394616262","https://openalex.org/W2014111643","https://openalex.org/W192406999"],"abstract_inverted_index":{"In":[0,174],"the":[1,4,7,12,16,33,42,55,75,81,92,106,127,140,175,180,183,188],"article,":[2],"within":[3],"framework":[5],"of":[6,14,18,44,54,57,80,83,94,105,109,136,143,162,182,185,190],"Boolean":[8,20],"Satisfiability":[9],"problem":[10,13,135,150],"(SAT),":[11],"estimating":[15],"hardness":[17,46,82],"specific":[19,24],"formulas":[21],"w.r.t.":[22,85,96],"a":[23,61,97,110,152,160,163],"complete":[25,70],"SAT":[26,62,71,197],"solving":[27,194],"algorithm":[28],"is":[29,50,67,145],"considered.":[30],"Based":[31],"on":[32,126],"well-known":[34],"Strong":[35],"Backdoor":[36],"Set":[37],"(SBS)":[38],"concept,":[39],"we":[40,170,178],"introduce":[41],"notion":[43],"decomposition":[45],"(d-hardness).":[47],"If":[48],"$B$":[49,99,138],"an":[51,68,78,148],"arbitrary":[52,69],"subset":[53],"set":[56],"variables":[58],"occurring":[59],"in":[60,103],"formula":[63],"$C$,":[64],"and":[65,87,118,187],"$A$":[66,86],"solver":[72],",":[73],"then":[74],"d-hardness":[76,93,144,186],"expresses":[77],"estimate":[79],"$C$":[84,95],"$B$.":[88],"We":[89],"show":[90],"that":[91],"particular":[98],"can":[100,131],"be":[101,132],"expressed":[102],"terms":[104],"expected":[107],"value":[108,142],"special":[111],"random":[112],"variable":[113],"associated":[114],"with":[115,139],"$A$,":[116],"$B$,":[117],"$C$.":[119],"For":[120],"its":[121,191],"computational":[122],"evaluation,":[123],"algorithms":[124],"based":[125],"Monte":[128],"Carlo":[129],"method":[130],"used.":[133],"The":[134],"finding":[137],"minimum":[141],"formulated":[146],"as":[147,159],"optimization":[149],"for":[151],"pseudo-Boolean":[153],"function":[154],"whose":[155],"values":[156],"are":[157],"calculated":[158],"result":[161],"probabilistic":[164],"experiment.":[165],"To":[166],"minimize":[167],"this":[168],"function,":[169],"use":[171],"evolutionary":[172],"algorithms.":[173],"experimental":[176],"part,":[177],"demonstrate":[179],"applicability":[181],"concept":[184],"methods":[189],"estimation":[192],"to":[193],"hard":[195],"unsatisfiable":[196],"instances.":[198]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4389982861","counts_by_year":[],"updated_date":"2025-01-06T08:20:29.682593","created_date":"2023-12-20"}