{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T22:52:27Z","timestamp":1774219947276,"version":"3.50.1"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T00:00:00Z","timestamp":1732147200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T00:00:00Z","timestamp":1732147200000},"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":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s11432-023-3900-7","type":"journal-article","created":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T22:56:39Z","timestamp":1732316199000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Optimizing local search-based partial MaxSAT solving via initial assignment prediction"],"prefix":"10.1007","volume":"68","author":[{"given":"Chanjuan","family":"Liu","sequence":"first","affiliation":[]},{"given":"Guangyuan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Chuan","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Shaowei","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Zhendong","family":"Lei","sequence":"additional","affiliation":[]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Chu","sequence":"additional","affiliation":[]},{"given":"Guojing","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,21]]},"reference":[{"key":"3900_CR1","doi-asserted-by":"publisher","first-page":"072109","DOI":"10.1007\/s11432-013-5052-x","volume":"57","author":"P Huang","year":"2014","unstructured":"Huang P, Yin M H. An upper (lower) bound for Max (Min) CSP. Sci China Inf Sci, 2014, 57: 072109","journal-title":"Sci China Inf Sci"},{"key":"3900_CR2","doi-asserted-by":"publisher","first-page":"5695","DOI":"10.1109\/TCYB.2021.3108597","volume":"52","author":"H Huang","year":"2022","unstructured":"Huang H, Yang S L, Li X Q, et al. An embedded hamiltonian graph-guided heuristic algorithm for two-echelon vehicle routing problem. IEEE Trans Cybern, 2022, 52: 5695\u20135707","journal-title":"IEEE Trans Cybern"},{"key":"3900_CR3","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1023\/A:1009769509401","volume":"3","author":"M Mouhoub","year":"1998","unstructured":"Mouhoub M, Charpillet F, Haton J P. Experimental analysis of numeric and symbolic constraint satisfaction techniques for temporal reasoning. Constraints, 1998, 3: 151\u2013164","journal-title":"Constraints"},{"key":"3900_CR4","doi-asserted-by":"publisher","first-page":"110254","DOI":"10.1016\/j.automatica.2022.110254","volume":"140","author":"C J Liu","year":"2022","unstructured":"Liu C J, Zhu E Q, Zhang Y K, et al. Characterization, verification and generation of strategies in games with resource constraints. Automatica, 2022, 140: 110254","journal-title":"Automatica"},{"key":"3900_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(93)90170-G","volume":"59","author":"A K Mackworth","year":"1993","unstructured":"Mackworth A K, Freuder E C. The complexity of constraint satisfaction revisited. Artif Intell, 1993, 59: 57\u201362","journal-title":"Artif Intell"},{"key":"3900_CR6","first-page":"151","volume-title":"Proceedings of the 3rd Annual ACM Symposium on Theory of Computing","author":"S A Cook","year":"1971","unstructured":"Cook S A. The complexity of theorem-proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, Shaker Heights, 1971. 151\u2013158"},{"key":"3900_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s11427-016-0386-2","volume":"60","author":"Y Li","year":"2017","unstructured":"Li Y, Liu G, Lou X, et al. Intra-individual comparison of different gadolinium-based contrast agents in the quantitative evaluation of C6 glioma with dynamic contrast-enhanced magnetic resonance imaging. Sci China Life Sci, 2017, 60: 11\u201315","journal-title":"Sci China Life Sci"},{"key":"3900_CR8","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.cor.2016.08.004","volume":"78","author":"E Demirovi\u0107","year":"2017","unstructured":"Demirovi\u0107 E, Musliu N. MaxSAT-based large neighborhood search for high school timetabling. Comput Operations Res, 2017, 78: 172\u2013180","journal-title":"Comput Operations Res"},{"key":"3900_CR9","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1613\/jair.4953","volume":"55","author":"Z W Fang","year":"2016","unstructured":"Fang Z W, Li C M, Xu K. An exact algorithm based on MaxSAT reasoning for the maximum weight clique problem. J Artif Intell Res, 2016, 55: 799\u2013833","journal-title":"J Artif Intell Res"},{"key":"3900_CR10","first-page":"613","volume-title":"Proceedings of the Handbook of Satisfiability","author":"C M Li","year":"2009","unstructured":"Li C M, Many\u00e0 F. MaxSAT, hard and soft constraints. In: Proceedings of the Handbook of Satisfiability. Amsterdam: IOS Press, 2009. 613\u2013631"},{"key":"3900_CR11","volume-title":"Proceedings of the Network and Distributed System Security Symposium","author":"Y Feng","year":"2017","unstructured":"Feng Y, Bastani O, Martins R, et al. Automated synthesis of semantic malware signatures using maximum satisfiability. In: Proceedings of the Network and Distributed System Security Symposium, 2017"},{"key":"3900_CR12","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10479-017-2693-y","volume":"275","author":"E Demirovi\u0107","year":"2019","unstructured":"Demirovi\u0107 E, Musliu N, Winter F. Modeling and solving staff scheduling with partial weighted MaxSAT. Ann Oper Res, 2019, 275: 79\u201399","journal-title":"Ann Oper Res"},{"key":"3900_CR13","first-page":"212","volume-title":"Proceedings of the International Conference on Principles and Practice of Constraint Programming","author":"D A Cohen","year":"2004","unstructured":"Cohen D A, Cooper M C, Jeavons P. A complete characterization of complexity for Boolean constraint optimization problems. In: Proceedings of the International Conference on Principles and Practice of Constraint Programming, 2004. 212\u2013226"},{"key":"3900_CR14","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.artint.2016.11.001","volume":"243","author":"C Luo","year":"2017","unstructured":"Luo C, Cai S W, Su K L, et al. CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability. Artif Intell, 2017, 243: 26\u201344","journal-title":"Artif Intell"},{"key":"3900_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.artint.2013.01.002","volume":"196","author":"C Ans\u00f3tegui","year":"2013","unstructured":"Ans\u00f3tegui C, Bonet M L, Levy J. SAT-based MaxSAT algorithms. Artif Intell, 2013, 196: 77\u2013105","journal-title":"Artif Intell"},{"key":"3900_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.3233\/SAT190116","volume":"11","author":"A Ignatiev","year":"2019","unstructured":"Ignatiev A, Morgado A, Marques-Silva J. RC2: an efficient MaxSAT solver. J Satisfiability Boolean Modeling Comput, 2019, 11: 53\u201364","journal-title":"J Satisfiability Boolean Modeling Comput"},{"key":"3900_CR17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-030-30048-7_11","volume-title":"Proceedings of the International Conference on Principles and Practice of Constraint Programming","author":"E Demirovic","year":"2019","unstructured":"Demirovic E, Stuckey P J. Techniques inspired by local search for incomplete MaxSAT and the linear algorithm: varying resolution and solution-guided search. In: Proceedings of the International Conference on Principles and Practice of Constraint Programming, 2019. 177\u2013194"},{"key":"3900_CR18","first-page":"132","volume-title":"Proceedings of the 32nd International Conference on Tools with Artificial Intelligence","author":"M Piotr\u00f3w","year":"2020","unstructured":"Piotr\u00f3w M. UWrMaxSat: efficient solver for MaxSAT and pseudo-boolean problems. In: Proceedings of the 32nd International Conference on Tools with Artificial Intelligence, 2020. 132\u2013136"},{"key":"3900_CR19","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1613\/jair.2808","volume":"36","author":"H L Chieu","year":"2009","unstructured":"Chieu H L, Lee W S. Relaxed survey propagation for the weighted maximum satisfiability problem. J Artif Intell Res, 2009, 36: 229\u2013266","journal-title":"J Artif Intell Res"},{"key":"3900_CR20","doi-asserted-by":"publisher","first-page":"062103","DOI":"10.1007\/s11432-015-5377-8","volume":"60","author":"Y Y Wang","year":"2017","unstructured":"Wang Y Y, Ouyang D T, Zhang L M, et al. A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity. Sci China Inf Sci, 2017, 60: 062103","journal-title":"Sci China Inf Sci"},{"key":"3900_CR21","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.1109\/TCYB.2016.2556742","volume":"47","author":"M Mavrovouniotis","year":"2017","unstructured":"Mavrovouniotis M, Muller F M, Yang S. Ant colony optimization with local search for dynamic traveling salesman problems. IEEE Trans Cybern, 2017, 47: 1743\u20131756","journal-title":"IEEE Trans Cybern"},{"key":"3900_CR22","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.1109\/TCYB.2022.3199147","volume":"54","author":"C Luo","year":"2024","unstructured":"Luo C, Xing W Q, Cai S W, et al. NuSC: an effective local search algorithm for solving the set covering problem. IEEE Trans Cybern, 2024, 54: 1403\u20131416","journal-title":"IEEE Trans Cybern"},{"key":"3900_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2016.07.006","volume":"240","author":"S W Cai","year":"2016","unstructured":"Cai S W, Luo C, Lin J K, et al. New local search methods for partial MaxSAT. Artif Intell, 2016, 240: 1\u201318","journal-title":"Artif Intell"},{"key":"3900_CR24","doi-asserted-by":"publisher","first-page":"103354","DOI":"10.1016\/j.artint.2020.103354","volume":"287","author":"S W Cai","year":"2020","unstructured":"Cai S W, Lei Z D. Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability. Artif Intell, 2020, 287: 103354","journal-title":"Artif Intell"},{"key":"3900_CR25","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1109\/TCYB.2014.2343242","volume":"45","author":"C Luo","year":"2015","unstructured":"Luo C, Cai S W, Su K L, et al. Clause states based configuration checking in local search for satisfiability. IEEE Trans Cybern, 2015, 45: 1028\u20131041","journal-title":"IEEE Trans Cybern"},{"key":"3900_CR26","first-page":"570","volume-title":"Proceedings of the 20th European Conference on Artificial Intelligence","author":"C Luo","year":"2012","unstructured":"Luo C, Su K L, Cai S W. Improving local search for random 3-SAT using quantitative configuration checking. In: Proceedings of the 20th European Conference on Artificial Intelligence, 2012. 570\u2013575"},{"key":"3900_CR27","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-642-40627-0_37","volume-title":"Proceedings of the International Conference on Principles and Practice of Constraint Programming","author":"C Luo","year":"2013","unstructured":"Luo C, Cai S W, Wu W, et al. Focused random walk with configuration checking and break minimum for satisfiability. In: Proceedings of the International Conference on Principles and Practice of Constraint Programming, 2013. 481\u2013496"},{"key":"3900_CR28","first-page":"2703","volume-title":"Proceedings of the 28th AAAI Conference on Artificial Intelligence","author":"C Luo","year":"2014","unstructured":"Luo C, Cai S W, Wu W, et al. Double configuration checking in stochastic local search for satisfiability. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence, 2014. 2703\u20132709"},{"key":"3900_CR29","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/s10489-014-0556-7","volume":"41","author":"C Luo","year":"2014","unstructured":"Luo C, Su K L, Cai S W. More efficient two-mode stochastic local search for random 3-satisfiability. Appl Intell, 2014, 41: 665\u2013680","journal-title":"Appl Intell"},{"key":"3900_CR30","first-page":"1","volume-title":"Proceedings of the International Conference on Theory and Applications of Satisfiability Testing","author":"S Cai","year":"2015","unstructured":"Cai S, Luo C, Su K. CCAnr: a configuration checking based local search solver for non-random satisfiability. In: Proceedings of the International Conference on Theory and Applications of Satisfiability Testing, 2015. 1\u20138"},{"key":"3900_CR31","doi-asserted-by":"publisher","first-page":"1830","DOI":"10.1109\/TC.2014.2346196","volume":"64","author":"C Luo","year":"2015","unstructured":"Luo C, Cai S W, Wu W, et al. CCLS: an efficient local search algorithm for weighted maximum satisfiability. IEEE Trans Comput, 2015, 64: 1830\u20131843","journal-title":"IEEE Trans Comput"},{"key":"3900_CR32","first-page":"139","volume-title":"Proceedings of the 29th International Conference on Tools with Artificial Intelligence","author":"Y Chu","year":"2017","unstructured":"Chu Y, Luo C, Huang W X, et al. Hard neighboring variables based configuration checking in stochastic local search for weighted partial maximum satisfiability. In: Proceedings of the 29th International Conference on Tools with Artificial Intelligence, 2017. 139\u2013146"},{"key":"3900_CR33","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/s11704-018-7107-z","volume":"13","author":"Y Chu","year":"2019","unstructured":"Chu Y, Luo C, Cai S W, et al. Empirical investigation of stochastic local search for maximum satisfiability. Front Comput Sci, 2019, 13: 86\u201398","journal-title":"Front Comput Sci"},{"key":"3900_CR34","first-page":"373","volume-title":"Proceedings of the International Conference on Parallel Problem Solving from Nature","author":"C Luo","year":"2020","unstructured":"Luo C, Hoos H H, Cai S W. PbO-CCSAT: boosting local search for satisfiability using programming by optimisation. In: Proceedings of the International Conference on Parallel Problem Solving from Nature, 2020. 373\u2013389"},{"key":"3900_CR35","first-page":"332","volume-title":"Proceedings of the International Conference on Theory and Applications of Satisfiability Testing","author":"Z D Lei","year":"2021","unstructured":"Lei Z D, Cai S W, Luo C, et al. Efficient local search for pseudo boolean optimization. In: Proceedings of the International Conference on Theory and Applications of Satisfiability Testing, 2021. 332\u2013348"},{"key":"3900_CR36","first-page":"1","volume-title":"Proceedings of the International Conference on Principles and Practice of Constraint Programming","author":"S W Cai","year":"2021","unstructured":"Cai S W, Luo C, Zhang X D, et al. Improving local search for structured SAT formulas via unit propagation based construct and cut initialization. In: Proceedings of the International Conference on Principles and Practice of Constraint Programming, 2021. 1\u201310"},{"key":"3900_CR37","first-page":"3915","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","author":"Y Chu","year":"2023","unstructured":"Chu Y, Cai S W, Luo C. NuWLS: improving local search for (weighted) partial maxsat by new weighting techniques. In: Proceedings of the AAAI Conference on Artificial Intelligence, 2023. 3915\u20133923"},{"key":"3900_CR38","first-page":"571","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence","author":"S W Cai","year":"2017","unstructured":"Cai S W, Luo C, Zhang H C. From decimation to local search and back: a new approach to MaxSAT. In: Proceedings of the International Joint Conference on Artificial Intelligence, 2017. 571\u2013577"},{"key":"3900_CR39","first-page":"1177","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence","author":"W J Zhang","year":"2020","unstructured":"Zhang W J, Sun Z Y, Zhu Q H, et al. NLocalSAT: boosting local search with solution prediction. In: Proceedings of the International Joint Conference on Artificial Intelligence, 2020. 1177\u20131183"},{"key":"3900_CR40","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Y LeCun","year":"2015","unstructured":"LeCun Y, Bengio Y, Hinton G. Deep learning. Nature, 2015, 521: 436\u2013444","journal-title":"Nature"},{"key":"3900_CR41","first-page":"163","volume-title":"Proceedings of German Conference on Artificial Intelligence (K\u00fcnstliche Intelligenz)","author":"J Reisch","year":"2020","unstructured":"Reisch J, Gro\u00dfmann P, Kliewer N. Stable resolving-a randomized local search heuristic for MaxSAT. In: Proceedings of German Conference on Artificial Intelligence (K\u00fcnstliche Intelligenz). Berlin: Springer, 2020. 163\u2013175"},{"key":"3900_CR42","first-page":"1901","volume-title":"Proceedings of the 31st International Joint Conference on Artificial Intelligence","author":"J Z Zheng","year":"2022","unstructured":"Zheng J Z, He K, Zhou J R, et al. BandMaxSAT: a local search MaxSAT solver with multi-armed bandit. In: Proceedings of the 31st International Joint Conference on Artificial Intelligence, 2022. 1901\u20131907"},{"key":"3900_CR43","volume-title":"MaxSAT Evaluation 2021","author":"Z D Lei","year":"2019","unstructured":"Lei Z D, Cai S W, Geng F, et al. Satlike-c: solver description. MaxSAT Evaluation 2021, 2019. https:\/\/maxsat-evaluations.github.io\/2021\/"},{"key":"3900_CR44","doi-asserted-by":"publisher","first-page":"160409","DOI":"10.1007\/s11432-020-3248-y","volume":"64","author":"J X Chen","year":"2021","unstructured":"Chen J X, Lin G Q, Chen J X, et al. Towards efficient allocation of graph convolutional networks on hybrid computation-in-memory architecture. Sci China Inf Sci, 2021, 64: 160409","journal-title":"Sci China Inf Sci"},{"key":"3900_CR45","volume-title":"Proceedings of the British Machine Vision Conference","author":"M Edwards","year":"2016","unstructured":"Edwards M, Xie X H. Graph convolutional neural network. In: Proceedings of the British Machine Vision Conference, 2016"},{"key":"3900_CR46","volume-title":"Proceedings of the International Conference on Learning Representations","author":"D Selsam","year":"2019","unstructured":"Selsam D, Lamm M, B\u00fcnz B, et al. Learning a SAT solver from single-bit supervision. In: Proceedings of the International Conference on Learning Representations, 2019"},{"key":"3900_CR47","doi-asserted-by":"publisher","first-page":"13142","DOI":"10.1109\/TCYB.2021.3103811","volume":"52","author":"K W Li","year":"2022","unstructured":"Li K W, Zhang T, Wang R, et al. Deep reinforcement learning for combinatorial optimization: covering salesman problems. IEEE Trans Cybern, 2022, 52: 13142\u201313155","journal-title":"IEEE Trans Cybern"},{"key":"3900_CR48","volume-title":"Proceedings of the International Conference on Learning Representations","author":"K Simonyan","year":"2015","unstructured":"Simonyan K, Zisserman A. Very deep convolutional networks for large-scale image recognition. In: Proceedings of the International Conference on Learning Representations, 2015"},{"key":"3900_CR49","first-page":"1045","volume-title":"Proceedings of the Interspeech","author":"T Mikolov","year":"2010","unstructured":"Mikolov T, Karafi\u00e1t M, Burget L, et al. Recurrent neural network based language model. In: Proceedings of the Interspeech, 2010. 1045\u20131048"},{"key":"3900_CR50","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L Xu","year":"2008","unstructured":"Xu L, Hutter F, Hoos H H, et al. SATzilla: portfolio-based algorithm selection for SAT. J Artif Intell Res, 2008, 32: 565\u2013606","journal-title":"J Artif Intell Res"},{"key":"3900_CR51","first-page":"123","volume-title":"Proceedings of the International Conference on Theory and Applications of Satisfiability Testing","author":"J H Liang","year":"2016","unstructured":"Liang J H, Ganesh V, Poupart P, et al. Learning rate based branching heuristic for SAT solvers. In: Proceedings of the International Conference on Theory and Applications of Satisfiability Testing, 2016. 123\u2013140"},{"key":"3900_CR52","first-page":"7990","volume-title":"Proceedings of the International Conference on Neural Information Processing Systems","author":"E Yolcu","year":"2019","unstructured":"Yolcu E, P\u00f3czos B. Learning local search heuristics for Boolean satisfiability. In: Proceedings of the International Conference on Neural Information Processing Systems, 2019. 7990\u20138001"},{"key":"3900_CR53","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s12293-020-00310-9","volume":"12","author":"S Sadeg","year":"2020","unstructured":"Sadeg S, Hamdad L, Chettab H, et al. Feature selection based bee swarm meta-heuristic approach for combinatorial optimisation problems: a case-study on MaxSAT. Memetic Comp, 2020, 12: 283\u2013298","journal-title":"Memetic Comp"},{"key":"3900_CR54","unstructured":"Shi F, Lee C H, Bashar M K, et al. Transformer-based machine learning for fast SAT solvers and logic synthesis. 2021. ArXiv:2107.07116"},{"key":"3900_CR55","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-030-04221-9_48","volume-title":"Proceedings of the International Conference on Neural Information Processing Systems","author":"Z W Li","year":"2018","unstructured":"Li Z W, Chen Q F, Koltun V. Combinatorial optimization with graph convolutional networks and guided tree search. In: Proceedings of the International Conference on Neural Information Processing Systems, 2018. 537\u2013546"},{"key":"3900_CR56","first-page":"94","volume-title":"Proceedings of the International Conference on Theory and Applications of Satisfiability Testing","author":"J H Liang","year":"2018","unstructured":"Liang J H, Oh C, Mathew M, et al. Machine learning-based restart policy for CDCL SAT solvers. In: Proceedings of the International Conference on Theory and Applications of Satisfiability Testing, 2018. 94\u2013110"},{"key":"3900_CR57","first-page":"336","volume-title":"Proceedings of the International Conference on Theory and Applications of Satisfiability Testing","author":"D Selsam","year":"2019","unstructured":"Selsam D, Bj\u00f8rner N. Guiding high-performance sat solvers with unsat-core predictions. In: Proceedings of the International Conference on Theory and Applications of Satisfiability Testing. Berlin: Springer, 2019. 336\u2013353"},{"key":"3900_CR58","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-319-93417-4_38","volume-title":"Proceedings of the European Semantic Web Conference","author":"M S Schlichtkrull","year":"2018","unstructured":"Schlichtkrull M S, Kipf T N, Bloem P, et al. Modeling relational data with graph convolutional networks. In: Proceedings of the European Semantic Web Conference, 2018. 593\u2013607"},{"key":"3900_CR59","volume-title":"Proceedings of the International Conference on Learning Representations","author":"Y J Li","year":"2016","unstructured":"Li Y J, Tarlow D, Brockschmidt M, et al. Gated graph sequence neural networks. In: Proceedings of the International Conference on Learning Representations, 2016"},{"key":"3900_CR60","first-page":"2861","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence","author":"W Wu","year":"2018","unstructured":"Wu W, Li B, Chen L, et al. Efficient attributed network embedding via recursive randomized hashing. In: Proceedings of the International Joint Conference on Artificial Intelligence, 2018. 2861\u20132867"},{"key":"3900_CR61","first-page":"14","volume-title":"Proceedings of the SAT Competition","author":"A Biere","year":"2017","unstructured":"Biere A. CaDiCal, Lingeling, Plingeling, Treengeling and YalSAT entering the SAT Competition 2018. In: Proceedings of the SAT Competition, 2017. 14"},{"key":"3900_CR62","first-page":"51","volume-title":"Proceedings of the SAT Competition","author":"A Biere","year":"2020","unstructured":"Biere A, Fazekas K, Fleury M, et al. CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT Competition 2020. In: Proceedings of the SAT Competition, 2020. 51\u201353"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-023-3900-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-023-3900-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-023-3900-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T22:02:15Z","timestamp":1774216935000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-023-3900-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,21]]},"references-count":62,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["3900"],"URL":"https:\/\/doi.org\/10.1007\/s11432-023-3900-7","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,21]]},"assertion":[{"value":"2 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"122101"}}