{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T10:31:16Z","timestamp":1763202676099,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":73,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T00:00:00Z","timestamp":1665360000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Humanities and Social Science Research Project of Ministry of Education","award":["18YJCZH006"],"award-info":[{"award-number":["18YJCZH006"]}]},{"name":"Guangdong Basic and Applied Basic Research Foundation","award":["2022A1515011355,2020A1515010642"],"award-info":[{"award-number":["2022A1515011355,2020A1515010642"]}]},{"name":"Guangzhou Science and Technology Project","award":["202201011699"],"award-info":[{"award-number":["202201011699"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61976232,61876204,61906216"],"award-info":[{"award-number":["61976232,61876204,61906216"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangzhou Basic and Applied Basic Research Foundation","award":["2022A1515011355,2020A1515010642"],"award-info":[{"award-number":["2022A1515011355,2020A1515010642"]}]},{"name":"Guizhou Science Support Project","award":["2022-259"],"award-info":[{"award-number":["2022-259"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,10,10]]},"DOI":"10.1145\/3551349.3561163","type":"proceedings-article","created":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T20:43:54Z","timestamp":1672951434000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Checking LTL Satisfiability via End-to-end Learning"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3733-9361","authenticated-orcid":false,"given":"Weilin","family":"Luo","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-sen University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5357-9130","authenticated-orcid":false,"given":"Hai","family":"Wan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-sen University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7541-1387","authenticated-orcid":false,"given":"Delong","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-sen University, China"}]},{"given":"Jianfeng","family":"Du","sequence":"additional","affiliation":[{"name":"Guangdong University of Foreign Studies, China and Pazhou Lab, China"}]},{"given":"Hengdi","family":"Su","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University, China"}]}],"member":"320","published-online":{"date-parts":[[2023,1,5]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Miltiadis Allamanis Marc Brockschmidt and Mahmoud Khademi. 2018. Learning to Represent Programs with Graphs. In ICLR."},{"key":"e_1_3_2_1_2_1","unstructured":"Miltiadis Allamanis Pankajan Chanthirasegaran Pushmeet Kohli and Charles Sutton. 2017. Learning Continuous Semantic Representations of Symbolic Expressions. In ICML Vol.\u00a070. 80\u201388."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Dalal Alrajeh Jeff Kramer Alessandra Russo and Sebastin Uchitel. 2009. Learning operational requirements from goal models. In ICSE. 265\u2013275.","DOI":"10.1109\/ICSE.2009.5070527"},{"key":"e_1_3_2_1_4_1","unstructured":"Saeed Amizadeh Sergiy Matusevych and Markus Weimer. 2019. Learning To Solve Circuit-SAT: An Unsupervised Differentiable Approach. In ICLR."},{"key":"e_1_3_2_1_5_1","volume-title":"Leviathan: A New LTL Satisfiability Checking Tool Based on a One-Pass Tree-Shaped Tableau. In IJCAI. 950\u2013956.","author":"Bertello Matteo","year":"2016","unstructured":"Matteo Bertello, Nicola Gigante, Angelo Montanari, and Mark Reynolds. 2016. Leviathan: A New LTL Satisfiability Checking Tool Based on a One-Pass Tree-Shaped Tableau. In IJCAI. 950\u2013956."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Armin Biere Alessandro Cimatti Edmund\u00a0M. Clarke and Yunshan Zhu. 1999. Symbolic Model Checking without BDDs. In TACAS Vol.\u00a01579. 193\u2013207.","DOI":"10.1007\/3-540-49059-0_14"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Marco Bozzano Alessandro Cimatti Anthony\u00a0Fernandes Pires David Jones Greg Kimberly T. Petri R. Robinson and Stefano Tonetta. 2015. Formal Design and Safety Analysis of AIR6110 Wheel Brake System. In CAV Vol.\u00a09206. 518\u2013535.","DOI":"10.1007\/978-3-319-21690-4_36"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Aaron\u00a0R. Bradley. 2011. SAT-Based Model Checking without Unrolling. In VMCAI Vol.\u00a06538. 70\u201387.","DOI":"10.1007\/978-3-642-18275-4_7"},{"key":"e_1_3_2_1_9_1","unstructured":"Benedikt B\u00fcnz and Matthew Lamm. 2017. Graph Neural Networks and Boolean Satisfiability. CoRR abs\/1702.03592(2017). arXiv:1702.03592"},{"key":"e_1_3_2_1_10_1","unstructured":"Jonathon Cai Richard Shin and Dawn Song. 2017. Making Neural Programming Architectures Generalize via Recursion. In ICLR."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Chris Cameron Rex Chen Jason\u00a0S. Hartford and Kevin Leyton-Brown. 2020. Predicting Propositional Satisfiability via End-to-End Learning. In AAAI. 3324\u20133331.","DOI":"10.1609\/aaai.v34i04.5733"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Roberto Cavada Alessandro Cimatti Michele Dorigatti Alberto Griggio Alessandro Mariotti Andrea Micheli Sergio Mover Marco Roveri and Stefano Tonetta. 2014. The nuXmv symbolic model checker. In CAV. 334\u2013342.","DOI":"10.1007\/978-3-319-08867-9_22"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2015.06.009"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Alessandro Cimatti Marco Pistore Marco Roveri and Roberto Sebastiani. 2002. Improving the Encoding of LTL Model Checking into SAT. In VMCAI Vol.\u00a02294. 196\u2013207.","DOI":"10.1007\/3-540-47813-2_14"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011276507260"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Renzo Degiovanni Facundo Molina Germ\u00e1n Regis and Nazareno Aguirre. 2018. A genetic algorithm for goal-conflict identification. In ASE. 520\u2013531.","DOI":"10.1145\/3238147.3238220"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Alexandre Duret-Lutz Alexandre Lewkowicz Amaury Fauchille Thibaud Michaud Etienne Renault and Laurent Xu. 2016. Spot 2.0 - A Framework for LTL and \u03c9 -Automata Manipulation. In ATVA. 122\u2013129.","DOI":"10.1007\/978-3-319-46520-3_8"},{"key":"e_1_3_2_1_18_1","unstructured":"Niklas E\u00e9n Alan Mishchenko and Robert\u00a0K. Brayton. 2011. Efficient implementation of property directed reachability. In FMCAD. 125\u2013134."},{"key":"e_1_3_2_1_19_1","unstructured":"Richard Evans David Saxton David Amos Pushmeet Kohli and Edward Grefenstette. 2018. Can Neural Networks Understand Logical Entailment?. In ICLR."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11256"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/371282.371311"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Marco Gario Alessandro Cimatti Cristian Mattarei Stefano Tonetta and Kristin\u00a0Yvonne Rozier. 2016. Model Checking at Scale: Automated Air Traffic Control Design Space Exploration. In CAV Vol.\u00a09780. 3\u201322.","DOI":"10.1007\/978-3-319-41540-6_1"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Giuseppe\u00a0De Giacomo Riccardo\u00a0De Masellis and Marco Montali. 2014. Reasoning on LTL on Finite Traces: Insensitivity to Infiniteness. In AAAI. 1027\u20131033.","DOI":"10.1609\/aaai.v28i1.8872"},{"key":"e_1_3_2_1_24_1","unstructured":"Giuseppe\u00a0De Giacomo and Moshe\u00a0Y. Vardi. 2013. Linear Temporal Logic and Linear Dynamic Logic on Finite Traces. In IJCAI. 854\u2013860."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243792"},{"key":"e_1_3_2_1_26_1","unstructured":"Christopher Hahn Frederik Schmitt Jens\u00a0U. Kreber Markus\u00a0Norman Rabe and Bernd Finkbeiner. 2021. Teaching Temporal Logics to Neural Networks. In ICLR."},{"key":"e_1_3_2_1_27_1","first-page":"52","article-title":"Representation Learning on Graphs: Methods and Applications","volume":"40","author":"Hamilton L.","year":"2017","unstructured":"William\u00a0L. Hamilton, Rex Ying, and Jure Leskovec. 2017. Representation Learning on Graphs: Methods and Applications. IEEE Data Engineering Bulletin 40, 3 (2017), 52\u201374.","journal-title":"IEEE Data Engineering Bulletin"},{"key":"e_1_3_2_1_28_1","unstructured":"Jason\u00a0S. Hartford Devon\u00a0R. Graham Kevin Leyton-Brown and Siamak Ravanbakhsh. 2018. Deep Models of Interactions Across Sets. In ICML Vol.\u00a080. 1914\u20131923."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Yonit Kesten Zohar Manna Hugh McGuire and Amir Pnueli. 1993. A Decision Algorithm for Full Propositional Temporal Logic. In CAV Vol.\u00a0697. 97\u2013109.","DOI":"10.1007\/3-540-56922-7_9"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Orna Kupferman and Moshe\u00a0Y. Vardi. 1999. Model Checking of Safety Properties. In CAV Vol.\u00a01633. 172\u2013183.","DOI":"10.1007\/3-540-48683-6_17"},{"key":"e_1_3_2_1_31_1","volume-title":"Set Transformer: A Framework for Attention-based Permutation-Invariant Neural Networks. In ICML, Vol.\u00a097. 3744\u20133753.","author":"Lee Juho","year":"2019","unstructured":"Juho Lee, Yoonho Lee, Jungtaek Kim, Adam\u00a0R. Kosiorek, Seungjin Choi, and Yee\u00a0Whye Teh. 2019. Set Transformer: A Framework for Attention-based Permutation-Invariant Neural Networks. In ICML, Vol.\u00a097. 3744\u20133753."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exy013"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103369"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Jianwen Li Yinbo Yao Geguang Pu Lijun Zhang and Jifeng He. 2014. Aalta: an LTL satisfiability checker over Infinite\/Finite traces. In FSE. 731\u2013734.","DOI":"10.1145\/2635868.2661669"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Jianwen Li Lijun Zhang Geguang Pu Moshe\u00a0Y. Vardi and Jifeng He. 2013. LTL Satisfiability Checking Revisited. In TIME. 91\u201398.","DOI":"10.1109\/TIME.2013.19"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-017-0442-2"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Jianwen Li Shufang Zhu Geguang Pu and Moshe\u00a0Y. Vardi. 2015. SAT-Based Explicit LTL Reasoning. In HVC Vol.\u00a09434. 209\u2013224.","DOI":"10.1007\/978-3-319-26287-1_13"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-018-00326-5"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Weilin Luo Hai Wan Xiaotong Song Binhao Yang Hongzhen Zhong and Yin Chen. 2021. How to Identify Boundary Conditions with Contrasty Metric?. In ICSE. 1473\u20131484.","DOI":"10.1109\/ICSE43902.2021.00132"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Weilin Luo Hai Wan Hongzhen Zhong Ou Wei Biqing Fang and Xiaotong Song. 2021. An Efficient Two-phase Method for Prime Compilation of Non-clausal Boolean Formulae. In ICCAD. 1\u20139.","DOI":"10.1109\/ICCAD51958.2021.9643520"},{"key":"e_1_3_2_1_41_1","unstructured":"Mingjun Ma Dehui Du Yuanhao Liu Yanyun Wang and Yiyang Li. 2022. Efficient Adversarial Sequence Generation for RNN with Symbolic Weighted Finite Automata. In SafeAI@AAAI Vol.\u00a03087."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Fabrizio\u00a0Maria Maggi Marlon Dumas Luciano Garc\u00eda-Ba\u00f1uelos and Marco Montali. 2013. Discovering Data-Aware Declarative Process Models from Event Logs. In BPM Vol.\u00a08094. 81\u201396.","DOI":"10.1007\/978-3-642-40176-3_8"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Nicolas Markey and Philippe Schnoebelen. 2003. Model Checking a Path. In CONCUR Vol.\u00a02761. 248\u2013262.","DOI":"10.1007\/978-3-540-45187-7_17"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Kenneth\u00a0L. McMillan. 2003. Interpolation and SAT-Based Model Checking. In CAV Vol.\u00a02725. 1\u201313.","DOI":"10.1007\/978-3-540-45069-6_1"},{"key":"e_1_3_2_1_45_1","volume-title":"Janossy Pooling: Learning Deep Permutation-Invariant Functions for Variable-Size Inputs. In ICLR.","author":"Murphy L.","year":"2019","unstructured":"Ryan\u00a0L. Murphy, Balasubramaniam Srinivasan, Vinayak\u00a0A. Rao, and Bruno Ribeiro. 2019. Janossy Pooling: Learning Deep Permutation-Invariant Functions for Variable-Size Inputs. In ICLR."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Aditya Paliwal Sarah\u00a0M. Loos Markus\u00a0N. Rabe Kshitij Bansal and Christian Szegedy. 2020. Graph Representations for Higher-Order Logic and Theorem Proving. In AAAI. 2967\u20132974.","DOI":"10.1609\/aaai.v34i03.5689"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Amir Pnueli. 1977. The Temporal Logic of Programs. In FOCS. 46\u201357.","DOI":"10.1109\/SFCS.1977.32"},{"key":"e_1_3_2_1_48_1","unstructured":"Johannes Prescher Claudio\u00a0Di Ciccio and Jan Mendling. 2014. From Declarative Processes to Imperative Models. In SIMPDA Vol.\u00a01293. 162\u2013173."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"crossref","unstructured":"Marco\u00a0T\u00falio Ribeiro Sameer Singh and Carlos Guestrin. 2016. \u201cWhy Should I Trust You?\u201d: Explaining the Predictions of Any Classifier. In KDD. 1135\u20131144.","DOI":"10.1145\/2939672.2939778"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"crossref","unstructured":"Kristin\u00a0Y. Rozier and Moshe\u00a0Y. Vardi. 2007. LTL Satisfiability Checking. In SPIN Vol.\u00a04595. 149\u2013167.","DOI":"10.1007\/978-3-540-73370-6_11"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.5555\/3220920.3221237"},{"key":"e_1_3_2_1_52_1","volume-title":"Ivan Titov, and Max Welling.","author":"Schlichtkrull Michael\u00a0Sejr","year":"2018","unstructured":"Michael\u00a0Sejr Schlichtkrull, Thomas\u00a0N. Kipf, Peter Bloem, Rianne van\u00a0den Berg, Ivan Titov, and Max Welling. 2018. Modeling Relational Data with Graph Convolutional Networks. In ESWC, Vol.\u00a010843. 593\u2013607."},{"volume-title":"FSEN, Vol.\u00a05961","author":"Schuppan Viktor","key":"e_1_3_2_1_53_1","unstructured":"Viktor Schuppan. 2009. Towards a Notion of Unsatisfiable Cores for LTL. In FSEN, Vol.\u00a05961. Springer, 129\u2013145."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.01.014"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-015-0242-1"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Viktor Schuppan and Luthfi Darmawan. 2011. Evaluating LTL Satisfiability Solvers. In ATVA Vol.\u00a06996. 397\u2013413.","DOI":"10.1007\/978-3-642-24372-1_28"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"crossref","unstructured":"Stefan Schwendimann. 1998. A New One-Pass Tableau Calculus for PLTL. In TABLEAUX Vol.\u00a01397. 277\u2013292.","DOI":"10.1007\/3-540-69778-0_28"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"crossref","unstructured":"Daniel Selsam and Nikolaj Bj\u00f8rner. 2019. Guiding High-Performance SAT Solvers with Unsat-Core Predictions. In SAT Vol.\u00a011628. 336\u2013353.","DOI":"10.1007\/978-3-030-24258-9_24"},{"key":"e_1_3_2_1_59_1","unstructured":"Daniel Selsam Matthew Lamm Benedikt B\u00fcnz Percy Liang Leonardo de Moura and David\u00a0L. Dill. 2019. Learning a SAT Solver from Single-Bit Supervision. In ICLR. 1\u201311."},{"key":"e_1_3_2_1_60_1","unstructured":"Xujie Si Hanjun Dai Mukund Raghothaman Mayur Naik and Le Song. 2018. Learning Loop Invariants for Program Verification. In NeurIPS. 7762\u20137773."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3837"},{"key":"e_1_3_2_1_62_1","unstructured":"Richard Socher Brody Huval Christopher\u00a0D. Manning and Andrew\u00a0Y. Ng. 2012. Semantic Compositionality through Recursive Matrix-Vector Spaces. In EMNLP-CoNLL. 1201\u20131211."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"crossref","unstructured":"Richard Socher Alex Perelygin Jean Wu Jason Chuang Christopher\u00a0D. Manning Andrew\u00a0Y. Ng and Christopher Potts. 2013. Recursive Deep Models for Semantic Compositionality Over a Sentiment Treebank. In EMNLP. 1631\u20131642.","DOI":"10.18653\/v1\/D13-1170"},{"key":"e_1_3_2_1_64_1","unstructured":"Pashootan Vaezipoor Andrew\u00a0C. Li Rodrigo\u00a0Toro Icarte and Sheila\u00a0A. McIlraith. 2021. LTL2Action: Generalizing LTL Instructions for Multi-Task RL. In ICML Vol.\u00a0139. 10497\u201310508."},{"key":"e_1_3_2_1_65_1","unstructured":"Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan\u00a0N. Gomez Lukasz Kaiser and Illia Polosukhin. 2017. Attention is All you Need. In NeurIPS. 5998\u20136008."},{"key":"e_1_3_2_1_66_1","volume-title":"The tableau method for temporal logic: An overview. Logique et Analyse","author":"Wolper Pierre","year":"1985","unstructured":"Pierre Wolper. 1985. The tableau method for temporal logic: An overview. Logique et Analyse (1985), 119\u2013136."},{"key":"e_1_3_2_1_67_1","volume-title":"Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking. In TACAS, Vol.\u00a04963. 63\u201377.","author":"Wulf Martin\u00a0De","year":"2008","unstructured":"Martin\u00a0De Wulf, Laurent Doyen, Nicolas Maquet, and Jean-Fran\u00e7ois Raskin. 2008. Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking. In TACAS, Vol.\u00a04963. 63\u201377."},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"crossref","unstructured":"Yaqi Xie Fan Zhou and Harold Soh. 2021. Embedding Symbolic Temporal Knowledge into Deep Sequential Models. In ICRA. 4267\u20134273.","DOI":"10.1109\/ICRA48506.2021.9561952"},{"key":"e_1_3_2_1_69_1","unstructured":"Keyulu Xu Jingling Li Mozhi Zhang Simon\u00a0S. Du Ken-ichi Kawarabayashi and Stefanie Jegelka. 2020. What Can Neural Networks Reason About?. In ICLR."},{"key":"e_1_3_2_1_70_1","unstructured":"Manzil Zaheer Satwik Kottur Siamak Ravanbakhsh Barnab\u00e1s P\u00f3czos Ruslan Salakhutdinov and Alexander\u00a0J. Smola. 2017. Deep Sets. In NeurIPS. 3391\u20133401."},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"crossref","unstructured":"Wenjie Zhang Zeyu Sun Qihao Zhu Ge Li Shaowei Cai Yingfei Xiong and Lu Zhang. 2020. NLocalSAT: Boosting Local Search with Solution Prediction. In IJCAI. 1177\u20131183.","DOI":"10.24963\/ijcai.2020\/164"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"crossref","unstructured":"Xiyue Zhang Xiaoning Du Xiaofei Xie Lei Ma Yang Liu and Meng Sun. 2021. Decision-Guided Weighted Automata Extraction from Recurrent Neural Networks. In AAAI. 11699\u201311707.","DOI":"10.1609\/aaai.v35i13.17391"},{"key":"e_1_3_2_1_73_1","unstructured":"Yan Zhang Jonathon\u00a0S. Hare and Adam Pr\u00fcgel-Bennett. 2020. FSPool: Learning Set Representations with Featurewise Sort Pooling. In ICLR."}],"event":{"name":"ASE '22: 37th IEEE\/ACM International Conference on Automated Software Engineering","acronym":"ASE '22","location":"Rochester MI USA"},"container-title":["Proceedings of the 37th IEEE\/ACM International Conference on Automated Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3551349.3561163","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3551349.3561163","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T08:27:21Z","timestamp":1755851241000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3551349.3561163"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,10]]},"references-count":73,"alternative-id":["10.1145\/3551349.3561163","10.1145\/3551349"],"URL":"https:\/\/doi.org\/10.1145\/3551349.3561163","relation":{},"subject":[],"published":{"date-parts":[[2022,10,10]]},"assertion":[{"value":"2023-01-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}