{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T11:47:05Z","timestamp":1725709625046},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T00:00:00Z","timestamp":1639094400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T00:00:00Z","timestamp":1639094400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,12,10]]},"DOI":"10.1109\/paap54281.2021.9720482","type":"proceedings-article","created":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T20:26:05Z","timestamp":1646425565000},"page":"141-145","source":"Crossref","is-referenced-by-count":1,"title":["A Heuristic SAT Problems Solving Method based on LSTM Network"],"prefix":"10.1109","author":[{"given":"Yichuan","family":"Wang","sequence":"first","affiliation":[{"name":"College of Computer Science and Engineering, Xi'an University of Technology,Xi'an,China"}]},{"given":"Xiaolong","family":"Liang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Engineering, Xi'an University of Technology,Xi'an,China"}]},{"given":"Xinhong","family":"Hei","sequence":"additional","affiliation":[{"name":"College of Computer Science and Engineering, Xi'an University of Technology,Xi'an,China"}]},{"given":"Lei","family":"Zhu","sequence":"additional","affiliation":[{"name":"College of Computer Science and Engineering, Xi'an University of Technology,Xi'an,China"}]},{"given":"Wenjiang","family":"Ji","sequence":"additional","affiliation":[{"name":"College of Computer Science and Engineering, Xi'an University of Technology,Xi'an,China"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","author":"defferrard","year":"0","journal-title":"NIPS"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010074"},{"key":"ref12","article-title":"Empirical evaluation of gated recurrent neural networks on sequence modeling","author":"chung","year":"2014","journal-title":"arXiv Neural and Evolutionary Computing"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/72.80266"},{"key":"ref14","first-page":"489","article-title":"Using randomization and learning to solve hard real-world instances of satisfiability","author":"baptista","year":"0","journal-title":"International Conference on Principles and Practice of Constraint Programming"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1038\/nature16961"},{"key":"ref17","first-page":"440","article-title":"A new method for solving hard satisfiability problems","author":"selman","year":"1992","journal-title":"Proc of Tenth National Conference on Artificial Intelligence"},{"key":"ref18","first-page":"272","article-title":"SATO: An efficient propositional prover","author":"zhang","year":"2006","journal-title":"Proceedings of the Ninth International Conference on Automated Deduction"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"ref3","article-title":"SATLIB: An online resource for research on SAT","author":"hoos","year":"0","journal-title":"SAT"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/12.769433"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1145\/196244.196621","article-title":"dynamic search-space pruning techniques in path sensitization","author":"marques silva","year":"1994","journal-title":"31st Design Automation Conference"},{"key":"ref8","article-title":"Learning a SAT solver from single-bit supervision","author":"selsam","year":"0","journal-title":"International Conference on Learning Representations"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1287624.1287653"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1049\/cje.2019.01.004"}],"event":{"name":"2021 12th International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)","start":{"date-parts":[[2021,12,10]]},"location":"Xi'an, China","end":{"date-parts":[[2021,12,12]]}},"container-title":["2021 12th International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9720298\/9720304\/09720482.pdf?arnumber=9720482","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T21:14:08Z","timestamp":1655759648000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9720482\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,10]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/paap54281.2021.9720482","relation":{},"subject":[],"published":{"date-parts":[[2021,12,10]]}}}