{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T17:19:58Z","timestamp":1782753598172,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":56,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,25]]},"DOI":"10.1145\/3485447.3512008","type":"proceedings-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T05:11:23Z","timestamp":1650863483000},"page":"912-924","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":114,"title":["Knowledge Graph Reasoning with Relational Digraph"],"prefix":"10.1145","author":[{"given":"Yongqi","family":"Zhang","sequence":"first","affiliation":[{"name":"4Paradigm Inc., China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Quanming","family":"Yao","sequence":"additional","affiliation":[{"name":"EE, Tsinghua University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"A. Abujabal R. Saha\u00a0Roy M. Yahya and G. Weikum. 2018. Never-ending learning for open-domain question answering over knowledge bases. In The WebConf. 1053\u20131062.","DOI":"10.1145\/3178876.3186004"},{"key":"e_1_3_2_1_3_1","volume-title":"Graph drawing: algorithms for the visualization of graphs","author":"Battista D.","unstructured":"G.\u00a0D. Battista, P. Eades, R. Tamassia, and I.\u00a0G Tollis. 1998. Graph drawing: algorithms for the visualization of graphs. Prentice Hall PTR."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"J. Berant and P. Liang. 2014. Semantic parsing via paraphrasing. In ACL. 1415\u20131425.","DOI":"10.3115\/v1\/P14-1133"},{"key":"e_1_3_2_1_5_1","unstructured":"A. Bordes N. Usunier A. Garcia-Duran J. Weston and O. Yakhnenko. 2013. Translating embeddings for modeling multi-relational data. In NeurIPS. 2787\u20132795."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Y. Cao X. Wang X. He Z. Hu and T. Chua. 2019. Unifying knowledge graph learning and recommendation: Towards a better understanding of user preferences. In The WebConf. 151\u2013161.","DOI":"10.1145\/3308558.3313705"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112948"},{"key":"e_1_3_2_1_8_1","unstructured":"W.\u00a0W Cohen H. Sun R\u00a0A. Hofer and M. Siegler. 2019. Scalable Neural Methods for Reasoning With a Symbolic Knowledge Base. In ICLR."},{"key":"e_1_3_2_1_9_1","unstructured":"R. Das S. Dhuliawala M. Zaheer L. Vilnis I. Durugkar A. Krishnamurthy A. Smola and A. McCallum. 2017. Go for a walk and arrive at the answer: Reasoning over paths in knowledge bases using reinforcement learning. In ICLR."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"T. Dettmers P. Minervini P. Stenetorp and S. Riedel. 2017. Convolutional 2D knowledge graph embeddings. In AAAI.","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"e_1_3_2_1_11_1","volume-title":"Diffmg: Differentiable meta graph search for heterogeneous graph neural networks. In SIGKDD. 279\u2013288.","author":"Ding Y.","year":"2021","unstructured":"Y. Ding, Q. Yao, H. Zhao, and T. Zhang. 2021. Diffmg: Differentiable meta graph search for heterogeneous graph neural networks. In SIGKDD. 279\u2013288."},{"key":"e_1_3_2_1_12_1","unstructured":"J. Gilmer S.\u00a0S Schoenholz P.\u00a0F Riley O. Vinyals and G.\u00a0E Dahl. 2017. Neural Message Passing for Quantum Chemistry. In ICML. 1263\u20131272."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"A. Grover and J. Leskovec. 2016. Node2vec: Scalable feature learning for networks. In SIGKDD. ACM 855\u2013864.","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_1_14_1","unstructured":"W. Hamilton Z. Ying and J. Leskovec. 2017. Inductive representation learning on large graphs. In NeurIPS. 1024\u20131034."},{"key":"e_1_3_2_1_15_1","unstructured":"L\u00a0V. Harsha\u00a0V. G. Jia and S. Kok. 2020. Probabilistic logic graph attention networks for reasoning. In Companion of WebConf. 669\u2013673."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447772"},{"key":"e_1_3_2_1_17_1","volume-title":"Approximation capabilities of multilayer feedforward networks. Neural networks 4, 2","author":"Hornik K.","year":"1991","unstructured":"K. Hornik. 1991. Approximation capabilities of multilayer feedforward networks. Neural networks 4, 2 (1991), 251\u2013257."},{"key":"e_1_3_2_1_18_1","unstructured":"S. Ji S. Pan E. Cambria P. Marttinen and P. Yu. 2020. A survey on knowledge graphs: Representation acquisition and applications. TKDE (2020)."},{"key":"e_1_3_2_1_19_1","volume-title":"Adam: A method for stochastic optimization. Technical Report. arXiv:1412.6980.","author":"Kingma P","year":"2014","unstructured":"D.\u00a0P Kingma and J. Ba. 2014. Adam: A method for stochastic optimization. Technical Report. arXiv:1412.6980."},{"key":"e_1_3_2_1_20_1","unstructured":"T. Kipf and M. Welling. 2016. Semi-supervised classification with graph convolutional networks. In ICLR."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"S. Kok and P. Domingos. 2007. Statistical predicate invention. In ICML. 433\u2013440.","DOI":"10.1145\/1273496.1273551"},{"key":"e_1_3_2_1_22_1","unstructured":"T. Lacroix N. Usunier and G. Obozinski. 2018. Canonical Tensor Decomposition for Knowledge Base Completion. In ICML. 2863\u20132872."},{"key":"e_1_3_2_1_23_1","volume-title":"Relational retrieval using a combination of path-constrained random walks. Machine learning 81, 1","author":"Lao N.","year":"2010","unstructured":"N. Lao and W.\u00a0W Cohen. 2010. Relational retrieval using a combination of path-constrained random walks. Machine learning 81, 1 (2010), 53\u201367."},{"key":"e_1_3_2_1_24_1","unstructured":"N. Lao T. Mitchell and W. Cohen. 2011. Random walk inference and learning in a large scale knowledge base. In EMNLP. 529\u2013539."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"C. Meilicke M. Fink Y. Wang D. Ruffinelli R. Gemulla and H. Stuckenschmidt. 2018. Fine-grained evaluation of rule-and embedding-based systems for knowledge graph completion. In ISWC. Springer 3\u201320.","DOI":"10.1007\/978-3-030-00671-6_1"},{"key":"e_1_3_2_1_26_1","unstructured":"M. Niepert. 2016. Discriminative gaifman models. In NIPS Vol.\u00a029. 3405\u20133413."},{"key":"e_1_3_2_1_27_1","unstructured":"A. Paszke S. Gross S. Chintala G. Chanan E. Yang Z. DeVito Z. Lin A. Desmaison L. Antiga and A. Lerer. 2017. Automatic differentiation in PyTorch. In ICLR."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_1_29_1","unstructured":"M. Qu J. Chen L. Xhonneux Y. Bengio and J. Tang. 2021. RNNLogic: Learning Logic Rules for Reasoning on Knowledge Graphs. In ICLR."},{"key":"e_1_3_2_1_30_1","first-page":"7712","article-title":"Probabilistic Logic Neural Networks for Reasoning","volume":"32","author":"Qu M.","year":"2019","unstructured":"M. Qu and J. Tang. 2019. Probabilistic Logic Neural Networks for Reasoning. NeurIPS 32, 7712\u20137722.","journal-title":"NeurIPS"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"A. Rossi D. Firmani A. Matinata P. Merialdo and D. Barbosa. 2021. Knowledge Graph Embedding for Link Prediction: A Comparative Analysis. TKDD (2021).","DOI":"10.1145\/3424672"},{"key":"e_1_3_2_1_32_1","unstructured":"D. Ruffinelli S. Broscheit and R. Gemulla. 2020. You can teach an old dog new tricks! on training knowledge graph embeddings. In ICLR."},{"key":"e_1_3_2_1_33_1","volume-title":"DRUM: End-To-End Differentiable Rule Mining On Knowledge Graphs. In NeurIPS. 15347\u201315357.","author":"Sadeghian A.","year":"2019","unstructured":"A. Sadeghian, M. Armandpour, P. Ding, and D Wang. 2019. DRUM: End-To-End Differentiable Rule Mining On Knowledge Graphs. In NeurIPS. 15347\u201315357."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"M. Schlichtkrull T.\u00a0N Kipf P. Bloem Rianne Van\u00a0D. I. Titov and M. Welling. 2018. Modeling relational data with graph convolutional networks. In ESWC. Springer 593\u2013607.","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"e_1_3_2_1_35_1","volume-title":"M-walk: Learning to walk over graphs using monte carlo tree search. In NeurIPS.","author":"Shen Y.","year":"2018","unstructured":"Y. Shen, J. Chen, Y. Huang, P.and\u00a0Guo, and J. Gao. 2018. M-walk: Learning to walk over graphs using monte carlo tree search. In NeurIPS."},{"key":"e_1_3_2_1_36_1","unstructured":"Z. Sun Z. Deng J. Nie and J. Tang. 2019. RotatE: Knowledge graph embedding by relational rotation in complex space. In ICLR."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Z. Sun S. Vashishth S. Sanyal P. Talukdar and Y. Yang. 2020. A Re-evaluation of Knowledge Graph Completion Methods. In ACL. 5516\u20135522.","DOI":"10.18653\/v1\/2020.acl-main.489"},{"key":"e_1_3_2_1_38_1","unstructured":"K.\u00a0K Teru E. Denis and W. Hamilton. 2020. Inductive Relation Prediction by Subgraph Reasoning. In ICML."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"K. Toutanova and D. Chen. 2015. Observed versus latent features for knowledge base and text inference. In PWCVSMC. 57\u201366.","DOI":"10.18653\/v1\/W15-4007"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/3122009.3208011"},{"key":"e_1_3_2_1_41_1","unstructured":"S. Vashishth S. Sanyal V. Nitin and P. Talukdar. 2019. Composition-based multi-relational graph convolutional networks. In ICLR."},{"key":"e_1_3_2_1_42_1","unstructured":"P. Veli\u010dkovi\u0107 G. Cucurull A. Casanova A. Romero P. Lio and Y. Bengio. 2017. Graph attention networks. In ICLR."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"H. Wang H. Ren and J. Leskovec. 2021. Relational Message Passing for Knowledge Graph Completion. In SIGKDD. 1697\u20131707.","DOI":"10.1145\/3447548.3467247"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2754499"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"W. Xiao H. Zhao V.\u00a0W Zheng and Y. Song. 2021. Neural PathSim for Inductive Similarity Search in Heterogeneous Information Networks. In CIKM. 2201\u20132210.","DOI":"10.1145\/3459637.3482454"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"W. Xiong T. Hoang and W. Wang. 2017. DeepPath: A Reinforcement Learning Method for Knowledge Graph Reasoning. In EMNLP. 564\u2013573.","DOI":"10.18653\/v1\/D17-1060"},{"key":"e_1_3_2_1_47_1","unstructured":"X. Xu W. Feng Y. Jiang X. Xie Z. Sun and Z. Deng. 2019. Dynamically Pruned Message Passing Networks for Large-Scale Knowledge Graph Reasoning. In ICLR."},{"key":"e_1_3_2_1_48_1","unstructured":"F. Yang Z. Yang and W. Cohen. 2017. Differentiable learning of logical rules for knowledge base reasoning. In NeurIPS. 2319\u20132328."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"crossref","unstructured":"D. Yu Y. Yang R. Zhang and Y. Wu. 2021. Knowledge Embedding Based Graph Convolutional Network. In The WebConf. 1619\u20131628.","DOI":"10.1145\/3442381.3449925"},{"key":"e_1_3_2_1_50_1","unstructured":"M. Zhang and Y. Chen. 2019. Inductive Matrix Completion Based on Graph Neural Networks. In ICLR."},{"key":"e_1_3_2_1_51_1","unstructured":"S. Zhang Y. Tay L. Yao and Q. Liu. 2019. Quaternion knowledge graph embeddings. In NeurIPS."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"crossref","unstructured":"Y. Zhang H. Dai Z. Kozareva A.\u00a0J Smola and L. Song. 2018. Variational reasoning for question answering with knowledge graph. In AAAI.","DOI":"10.1609\/aaai.v32i1.12057"},{"key":"e_1_3_2_1_53_1","volume-title":"Interstellar: Searching Recurrent Architecture for Knowledge Graph Embedding. In NeurIPS, Vol.\u00a033.","author":"Zhang Y.","year":"2020","unstructured":"Y. Zhang, Q. Yao, and L. Chen. 2020. Interstellar: Searching Recurrent Architecture for Knowledge Graph Embedding. In NeurIPS, Vol.\u00a033."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"crossref","unstructured":"Y. Zhang Q. Yao W. Dai and L. Chen. 2020. AutoSF: Searching scoring functions for knowledge graph embedding. In ICDE. IEEE 433\u2013444.","DOI":"10.1109\/ICDE48307.2020.00044"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Y. Zhang Q. Yao Y. Shao and L. Chen. 2019. NSCaching: simple and efficient negative sampling for knowledge graph embedding. In ICDE. IEEE 614\u2013625.","DOI":"10.1109\/ICDE.2019.00061"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"crossref","unstructured":"H. Zhao Q. Yao J. Li Y. Song and K.\u00a0L. Lee. 2017. Meta-graph based recommendation fusion over heterogeneous information networks. In SIGKDD. 635\u2013644.","DOI":"10.1145\/3097983.3098063"},{"key":"e_1_3_2_1_57_1","unstructured":"Z. Zhu Z. Zhang L. Xhonneux and J. Tang. 2021. Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction In NeurIPS. arXiv e-prints arXiv\u20132106."}],"event":{"name":"WWW '22: The ACM Web Conference 2022","location":"Virtual Event, Lyon France","acronym":"WWW '22","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2022"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512008","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3485447.3512008","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:10Z","timestamp":1750191130000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":56,"alternative-id":["10.1145\/3485447.3512008","10.1145\/3485447"],"URL":"https:\/\/doi.org\/10.1145\/3485447.3512008","relation":{},"subject":[],"published":{"date-parts":[[2022,4,25]]},"assertion":[{"value":"2022-04-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}