{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T19:46:35Z","timestamp":1776368795371,"version":"3.51.2"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T00:00:00Z","timestamp":1658102400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T00:00:00Z","timestamp":1658102400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100005375","name":"Latvian Council of Science","doi-asserted-by":"publisher","award":["lzp-2018\/1-0327,lzp-2021\/1-0479"],"award-info":[{"award-number":["lzp-2018\/1-0327,lzp-2021\/1-0479"]}],"id":[{"id":"10.13039\/501100005375","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,7,18]]},"DOI":"10.1109\/ijcnn55064.2022.9892733","type":"proceedings-article","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T19:56:04Z","timestamp":1664567764000},"page":"1-8","source":"Crossref","is-referenced-by-count":11,"title":["Goal-Aware Neural SAT Solver"],"prefix":"10.1109","author":[{"given":"Emils","family":"Ozolins","sequence":"first","affiliation":[{"name":"Institute of Mathematics and Computer Science, University of Latvia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karlis","family":"Freivalds","sequence":"additional","affiliation":[{"name":"Institute of Mathematics and Computer Science, University of Latvia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andis","family":"Draguns","sequence":"additional","affiliation":[{"name":"Institute of Mathematics and Computer Science, University of Latvia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eliza","family":"Gaile","sequence":"additional","affiliation":[{"name":"Institute of Mathematics and Computer Science, University of Latvia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronalds","family":"Zakovskis","sequence":"additional","affiliation":[{"name":"Institute of Mathematics and Computer Science, University of Latvia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergejs","family":"Kozlovics","sequence":"additional","affiliation":[{"name":"Institute of Mathematics and Computer Science, University of Latvia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"PDP: A General Neural Framework for Learning Constraint Satisfaction Solvers","author":"amizadeh","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref11","author":"ozoli?\u0161","year":"2020","journal-title":"Matrix Shuffle-Exchange Networks for Hard 2D Tasks"},{"key":"ref12","author":"selsam","year":"2019","journal-title":"Guiding high-performance SAT solvers with unsat-core predictions"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66263-3_30"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(95)00046-1"},{"key":"ref15","first-page":"51","article-title":"Minimalistic Round-reduced SHA-1 Pre-image Attack","author":"skladanivskyy","year":"2019","journal-title":"SAT RACE 2019 Solver and Benchmark Descriptions"},{"key":"ref16","article-title":"Tailored compact cnf encoding for sha-1","author":"skladanivskyy","year":"2020","journal-title":"J Satisfiab Boolean Model Comput"},{"key":"ref17","first-page":"440","article-title":"A new method for solving hard satisfiability problems","author":"selman","year":"0","journal-title":"AAAI'92 Proceedings of the tenth national conference on Artificial intelligence"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1142\/S0218213018400018"},{"key":"ref19","first-page":"502","article-title":"An extensible SAT-solver","author":"e\u00e9n","year":"2003","journal-title":"International Conference on Theory and Applications of Satisfiability Testing"},{"key":"ref4","volume":"185","author":"biere","year":"2009","journal-title":"Handbook of Satisfiability"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1186\/s40687-014-0012-7"},{"key":"ref3","article-title":"Learning to learn by gradient descent by gradient descent","author":"andrychowicz","year":"2016","journal-title":"ArXiv Preprint"},{"key":"ref6","first-page":"1931","article-title":"DL2: Training and querying neural networks with logic","volume":"97","author":"fischer","year":"2019","journal-title":"Proceedings of the 36th International Conference on Machine Learning"},{"key":"ref5","article-title":"Cln2inv: Learning loop invariants with continuous logic networks","author":"ryan","year":"0","journal-title":"International Conference on Learning Representations"},{"key":"ref8","article-title":"PairNorm: Tackling oversmoothing in GNNs","author":"zhao","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref7","article-title":"Adabelief optimizer: Adapting stepsizes by the belief in observed gradients","author":"zhuang","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref2","article-title":"Learning To Solve Circuit-SAT: An Unsupervised Differentiable Approach","author":"amizadeh","year":"0","journal-title":"International Conference on Learning Representations"},{"key":"ref9","article-title":"Recurrent relational networks","author":"palm","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref1","article-title":"Learning a SAT solver from single-bit supervision","author":"selsam","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref20","first-page":"7990","article-title":"Learning Local Search Heuristics for Boolean Satisfiability","author":"yolcu","year":"2019","journal-title":"NeurIPS"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/595"},{"key":"ref21","article-title":"Machine learning for combinatorial optimization: a methodological tour d'horizon","author":"bengio","year":"2020","journal-title":"European Journal of Operational Research"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3400302.3415669"},{"key":"ref23","article-title":"Improving SAT solver heuristics with graph networks and reinforcement learning","author":"kurin","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i02.5515"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.29007\/3b2l"}],"event":{"name":"2022 International Joint Conference on Neural Networks (IJCNN)","location":"Padua, Italy","start":{"date-parts":[[2022,7,18]]},"end":{"date-parts":[[2022,7,23]]}},"container-title":["2022 International Joint Conference on Neural Networks (IJCNN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9891857\/9889787\/09892733.pdf?arnumber=9892733","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,3]],"date-time":"2022-11-03T22:58:28Z","timestamp":1667516308000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9892733\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,18]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/ijcnn55064.2022.9892733","relation":{},"subject":[],"published":{"date-parts":[[2022,7,18]]}}}