{"id":"https://openalex.org/W4214929510","doi":"https://doi.org/10.1109/paap54281.2021.9720482","title":"A Heuristic SAT Problems Solving Method based on LSTM Network","display_name":"A Heuristic SAT Problems Solving Method based on LSTM Network","publication_year":2021,"publication_date":"2021-12-10","ids":{"openalex":"https://openalex.org/W4214929510","doi":"https://doi.org/10.1109/paap54281.2021.9720482"},"language":"en","primary_location":{"id":"doi:10.1109/paap54281.2021.9720482","is_oa":false,"landing_page_url":"https://doi.org/10.1109/paap54281.2021.9720482","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 12th International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)","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/A5055818674","display_name":"Yichuan Wang","orcid":"https://orcid.org/0000-0002-1984-7610"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yichuan Wang","raw_affiliation_strings":["College of Computer Science and Engineering, Xi'an University of Technology,Xi'an,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer Science and Engineering, Xi'an University of Technology,Xi'an,China","institution_ids":[]}]},{"author_position":"middle","author":{"id":null,"display_name":"Xiaolong Liang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiaolong Liang","raw_affiliation_strings":["College of Computer Science and Engineering, Xi'an University of Technology,Xi'an,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer Science and Engineering, Xi'an University of Technology,Xi'an,China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073391035","display_name":"Xinhong Hei","orcid":"https://orcid.org/0000-0002-6394-0492"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xinhong Hei","raw_affiliation_strings":["College of Computer Science and Engineering, Xi'an University of Technology,Xi'an,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer Science and Engineering, Xi'an University of Technology,Xi'an,China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103029948","display_name":"Lei Zhu","orcid":"https://orcid.org/0000-0001-5925-5743"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lei Zhu","raw_affiliation_strings":["College of Computer Science and Engineering, Xi'an University of Technology,Xi'an,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer Science and Engineering, Xi'an University of Technology,Xi'an,China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028389618","display_name":"Wenjiang Ji","orcid":"https://orcid.org/0000-0001-5502-1579"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wenjiang Ji","raw_affiliation_strings":["College of Computer Science and Engineering, Xi'an University of Technology,Xi'an,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer Science and Engineering, Xi'an University of Technology,Xi'an,China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5055818674"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3045,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.64901172,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"141","last_page":"145"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9846000075340271,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11567","display_name":"semigroups and automata theory","score":0.982200026512146,"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.7930681705474854},{"id":"https://openalex.org/keywords/dpll-algorithm","display_name":"DPLL algorithm","score":0.6900308132171631},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6491564512252808},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.5916668176651001},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5907937288284302},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.5039686560630798},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.4810600280761719},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44414448738098145},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4210570454597473},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.41760244965553284},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3616744875907898},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.2553061842918396},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24395787715911865}],"concepts":[{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.7930681705474854},{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.6900308132171631},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6491564512252808},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.5916668176651001},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5907937288284302},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.5039686560630798},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.4810600280761719},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44414448738098145},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4210570454597473},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.41760244965553284},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3616744875907898},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.2553061842918396},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24395787715911865},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0},{"id":"https://openalex.org/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/paap54281.2021.9720482","is_oa":false,"landing_page_url":"https://doi.org/10.1109/paap54281.2021.9720482","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 12th International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)","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":25,"referenced_works":["https://openalex.org/W1487965496","https://openalex.org/W1511155470","https://openalex.org/W1518705996","https://openalex.org/W1667614912","https://openalex.org/W1855994541","https://openalex.org/W1924770834","https://openalex.org/W1984217603","https://openalex.org/W2036265926","https://openalex.org/W2044560939","https://openalex.org/W2057361103","https://openalex.org/W2064675550","https://openalex.org/W2120599220","https://openalex.org/W2141278204","https://openalex.org/W2155621670","https://openalex.org/W2257979135","https://openalex.org/W2786776430","https://openalex.org/W2934108431","https://openalex.org/W2964321699","https://openalex.org/W6629443124","https://openalex.org/W6630643794","https://openalex.org/W6637229586","https://openalex.org/W6639239107","https://openalex.org/W6640212811","https://openalex.org/W6720006811","https://openalex.org/W6748262478"],"related_works":["https://openalex.org/W2061097805","https://openalex.org/W2796388654","https://openalex.org/W2080871662","https://openalex.org/W2332241156","https://openalex.org/W2014111643","https://openalex.org/W1531414918","https://openalex.org/W2154853422","https://openalex.org/W2558119813","https://openalex.org/W2623377418","https://openalex.org/W3120153087"],"abstract_inverted_index":{"Boolean":[0,44],"Satisfiability":[1],"Problem(SAT)":[2],"is":[3,16,83],"a":[4,70,94],"well":[5],"known":[6],"determination":[7],"Problem.":[8],"S.A.Cook":[9],"proved":[10],"in":[11,22,40,75],"1971":[12],"that":[13,213],"SAT":[14,36,81,96,121,135,168,185,204,220,235],"Problem":[15,21,30,37,82],"the":[17,23,35,78,116,131,140,144,156,160,164,167,184,192,196,200,214,226,230],"first":[18],"NP-Complete":[19],"(NPC)":[20],"world,":[24],"namely,":[25],"any":[26],"non-deterministic":[27],"Polynomial":[28,41],"(NP)":[29],"can":[31,48,124,223],"be":[32,49],"specified":[33],"with":[34,206],"for":[38],"solving":[39,97,193,221,227,236],"time.":[42],"Therefore,":[43,77],"satisfiability":[45,132],"problem":[46,186],"(SAT)":[47],"extended":[50],"to":[51,87,129,182,190],"many":[52],"practical":[53],"applications,":[54],"such":[55],"as":[56,118,159,189],"integrated":[57],"circuit":[58],"design":[59,93],"optimization,":[60],"biological":[61],"genes,":[62],"artificial":[63],"intelligence,":[64],"Internet,":[65],"etc.":[66],"And":[67],"there":[68],"are":[69],"lot":[71],"of":[72,80,84,109,133,143,163,166,174,203,229],"NP":[73],"problems":[74,205],"cryptography.":[76,88],"study":[79],"great":[85],"significance":[86],"In":[89,195],"this":[90],"paper,":[91],"we":[92,114,138,154,198],"heuristic":[95,219],"algorithm":[98,178],"based":[99,111,218],"on":[100,112],"LSTM":[101,145],"(Long":[102],"Short-Term":[103],"Memory)":[104],"recurrent":[105],"neural":[106],"networks.":[107],"First":[108],"all,":[110],"LSTM,":[113],"train":[115],"model":[117],"an":[119],"end-to-end":[120],"Solver,":[122],"which":[123],"output":[125,142],"0":[126],"or":[127,233],"1":[128],"represent":[130],"each":[134],"problem.":[136],"Then":[137],"extract":[139],"high-dimensional":[141],"network":[146],"and":[147,170,179,209,216],"carry":[148],"out":[149],"k-means":[150],"clustering":[151],"analysis.":[152],"Finally,":[153],"assign":[155],"obtained":[157],"results":[158,202,211],"initial":[161],"value":[162],"variables":[165],"problem,":[169],"inspire":[171],"two":[172],"types":[173],"classical":[175],"algorithms":[176],"(complete":[177],"incomplete":[180,234],"algorithm)":[181],"solve":[183],"respectively,":[187],"so":[188],"accelerate":[191],"process.":[194],"experiment,":[197],"demonstrated":[199],"test":[201],"different":[207],"sizes,":[208],"The":[210],"show":[212],"LSTM-WalkSAT":[215],"LSTM-DPLL":[217],"methods":[222],"significantly":[224],"improve":[225],"efficiency":[228],"original":[231],"complete":[232],"algorithms.":[237]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-03T08:25:01.440150","created_date":"2025-10-10T00:00:00"}