{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T22:13:56Z","timestamp":1772835236303,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":29,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819543830","type":"print"},{"value":"9789819543847","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T00:00:00Z","timestamp":1762387200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T00:00:00Z","timestamp":1762387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-4384-7_24","type":"book-chapter","created":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T15:43:16Z","timestamp":1762357396000},"page":"342-355","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["AEIN: Attention-Enhanced Iterative Join Graph Neural Networks"],"prefix":"10.1007","author":[{"given":"Jixin","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,6]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Achlioptas, D., Hammoudeh, Z., Theodoropoulos, P.: Fast and Flexible Probabilistic Model Counting, pp. 148\u2013164 (2018)","DOI":"10.1007\/978-3-319-94144-8_10"},{"key":"24_CR2","unstructured":"Amizadeh, S., Matusevych, S., Weimer, M.: Learning to solve circuit-sat: an unsupervised differentiable approach. In: International Conference on Learning Representations (2018)"},{"key":"24_CR3","unstructured":"Amizadeh, S., Matusevych, S., Weimer, M.: PDP: a general neural framework for learning constraint satisfaction solvers. Cornell University - arXiv (2019)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Atkari, A., Dhargalkar, N., Angne, H.: Employing Machine Learning Models to Solve Uniform Random 3-SAT, pp. 255\u2013264. Springer, Singapore (2019)","DOI":"10.1007\/978-981-15-0132-6_17"},{"key":"24_CR5","unstructured":"Bouttier, V., Jardri, R., Deneve, S.: Circular belief propagation for approximate probabilistic inference (2024)"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Clarke, E., Biere, A., Raimi, R., Zhu, Y.: Bounded model checking using satisfiability solving. In: Formal Methods in System Design, pp. 7\u201334 (2001)","DOI":"10.1023\/A:1011276507260"},{"key":"24_CR7","unstructured":"Dechter, R., Kask, K., Mateescu, R.: Iterative join-graph propagation (2013)"},{"key":"24_CR8","unstructured":"Domshlak, C., Hoffmann, J.: Fast probabilistic planning through weighted model counting (2006)"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Dudek, J., Phan, V., Vardi, M.: AddMC: weighted model counting with algebraic decision diagrams. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02, pp. 1468\u20131476 (2020)","DOI":"10.1609\/aaai.v34i02.5505"},{"issue":"3","key":"24_CR10","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.tcs.2008.03.013","volume":"404","author":"F Ivan\u010di\u0107","year":"2008","unstructured":"Ivan\u010di\u0107, F., Yang, Z., Ganai, M.K., Gupta, A., Ashar, P.: Efficient SAT-based bounded model checking for software verification. Theoret. Comput. Sci. 404(3), 256\u2013274 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Kirkley, A., Cantwell, G.T., Newman, M.E.J.: Belief propagation for networks with loops. arXiv (2020)","DOI":"10.1126\/sciadv.abf1211"},{"key":"24_CR12","unstructured":"Kuck, J., et al.: Belief propagation neural networks. Neural Information Processing Systems (2020)"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Lai, Y., Meel, K.S., Yap, R.H.C.: The power of literal equivalence in model counting. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 5, pp. 3851\u20133859 (2021)","DOI":"10.1609\/aaai.v35i5.16503"},{"key":"24_CR14","unstructured":"Lai, Y., Meel, K.S., Yap, R.H.C.: CCDD: a tractable representation for model counting and uniform sampling (2022)"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Lai, Y., Meel, K.S., Yap, R.H.C.: Fast converging anytime model counting. In: Williams, B., Chen, Y., Neville, J. (eds.) Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, 7\u201314 February 2023, pp. 4025\u20134034. AAAI Press (2023)","DOI":"10.1609\/aaai.v37i4.25517"},{"key":"24_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-031-98682-6_6","volume-title":"CAV 2025, Part III","author":"Y Lai","year":"2025","unstructured":"Lai, Y., Meel, K.S., Yap, R.H.C.: Panini: an efficient and flexible knowledge compiler. In: Piskac, R., Rakamaric, Z. (eds.) CAV 2025, Part III. LNCS, vol. 15933, pp. 92\u2013105. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-98682-6_6"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Li, Z., Si, X.: NSnet: a general neural probabilistic framework for satisfiability problems (2022)","DOI":"10.52202\/068431-1854"},{"issue":"7","key":"24_CR18","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1080\/0952813X.2022.2122588","volume":"36","author":"S L\u00fc","year":"2024","unstructured":"L\u00fc, S., Zhang, T., Yue, X., Zhou, W., Lai, Y.: Combining bounded solving and controllable randomization for approximate model counting. J. Exp. Theor. Artif. Intell. 36(7), 1075\u20131088 (2024)","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: Boolean satisfiability in electronic design automation. In: Proceedings of the 37th Conference on Design Automation - DAC \u201900, pp. 675\u2013680 (2000)","DOI":"10.1145\/337292.337611"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Muise, C., McIlraith, S.A., Beck, J.C., Hsu, E.I.: Dsharp: Fast d-DNNF Compilation with sharpSAT, pp. 356\u2013361 (2012)","DOI":"10.1007\/978-3-642-30353-1_36"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Ozolins, E., Freivalds, K., Draguns, A., Gaile, E., Zakovskis, R., Kozlovics, S.: Goal-aware neural sat solver. In: 2022 International Joint Conference on Neural Networks (IJCNN), pp. 1\u20138. IEEE (2022)","DOI":"10.1109\/IJCNN55064.2022.9892733"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Saveri, G., Bortolussi, L.: Graph neural networks for propositional model counting. arXiv (2022)","DOI":"10.14428\/esann\/2022.ES2022-88"},{"key":"24_CR23","unstructured":"Selsam, D., Lamm, M., B\u00fcnz, B., Liang, P., Moura, L., Dill, D.L.: Learning a sat solver from single-bit supervision. Learning (2018)"},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Sheeran, M., Singh, S., St\u00e5lmarck, G.: Checking Safety Properties Using Induction and a SAT- Solver, pp. 127\u2013144 (2000)","DOI":"10.1007\/3-540-40922-X_8"},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"Soos, M., Meel, K.S.: Bird: engineering an efficient CNF-XOR SAT solver and its applications to approximate model counting. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 1592\u20131599 (2019)","DOI":"10.1609\/aaai.v33i01.33011592"},{"key":"24_CR26","first-page":"424","volume-title":"sharpSAT \u2013 Counting Models with Advanced Component Caching and Implicit BCP","author":"M Thurley","year":"2006","unstructured":"Thurley, M.: sharpSAT \u2013 Counting Models with Advanced Component Caching and Implicit BCP, pp. 424\u2013429. Springer, Heidelberg (2006)"},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"Vaezipoor, P., et al.: Learning branching heuristics for propositional model counting. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 14, pp. 12427\u201312435 (2021)","DOI":"10.1609\/aaai.v35i14.17474"},{"key":"24_CR28","unstructured":"Wetzel, S.J., Ryczko, K., Melko, R.G., Tamblyn, I.: Twin neural network regression. arXiv (2020)"},{"key":"24_CR29","unstructured":"Zhang, Y.: Research on model counting methods based on machine learning. Master\u2019s thesis, Jilin University (2023)"}],"updated-by":[{"DOI":"10.1007\/978-981-95-4384-7_38","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T00:00:00Z","timestamp":1762387200000}}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-4384-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:09:32Z","timestamp":1772806172000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-4384-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,6]]},"ISBN":["9789819543830","9789819543847"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-4384-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,6]]},"assertion":[{"value":"6 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"6 November 2025","order":2,"name":"change_date","label":"Change Date","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Correction","order":3,"name":"change_type","label":"Change Type","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"A correction has been published.","order":4,"name":"change_details","label":"Change Details","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Okinawa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iconip2025.apnns.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}