arXiv:2506.05626v3 Announce Type: replace
Abstract: Real-world knowledge can take various forms, including structured, semi-structured, and unstructured data. Among these, Knowledge Graphs (KGs) are...
By Xiaohua Lu, Liubov Tupikina, Mehwish Alam
SLogic introduces a subgraph-informed approach to logical rule learning for knowledge graph completion, assigning query-dependent scores to rules instead of a single global weight. The framework uses a context-aware scoring function that evaluates the importance of a rule based on the local subgraph around the query’s head entity, aligning with the specificity principle of commonsense reasoning. Experiments on benchmark datasets demonstrate that SLogic performs competitively with other rule-based methods while producing human-readable, query-specific explanations.
By Trung Hoang Le, Tran Cao Son, Ishtiaq Ahmed, Huiping Cao
arXiv:2606. 05639v1 Announce Type: new Abstract: Knowledge Graph Completion (KGC) aims at predicting missing triplets from incomplete knowledge graphs, which is crucial for downstream applications.
By Dongxiao He, Ruqiong Zhang, Zhizhi Yu, Ling Ding, Di Jin, Guangquan Xu, Zhiyong Feng
arXiv:2610.14465v1 Announce Type: cross
Abstract: Structured knowledge retrieval acquires task-relevant evidence from structured knowledge sources for downstream tasks. Existing methods rely on uncon...
By Zhisheng Qi, Haoyu Han, Jiaxi Li, Bing He, Huiyuan Chen, Franck Dernoncourt, Ryan A. Rossi, Mahantesh M. Halappanavar, Jin Lu, Yu Zhang, Tianming Liu, Yu Wang
The paper introduces SLM-Conditioned Hierarchical Relation Routing, a graph neural network architecture that incorporates a small language model to guide message selection in labeled property graphs. It combines structural states, node and relationship property encodings, and relationship types into messages, then uses a parameter‑efficient language model to generate target‑conditioned routing queries that filter relevant messages and route information across relation‑level summaries. The resulting representation updates a topology anchor with bounded residuals, preserving structural evidence while allowing contextual semantic information to influence predictions, and offers interpretable analysis at both neighbor and relationship‑type levels.
By Michal Podstawski
arXiv:2606. 29860v1 Announce Type: new Abstract: Knowledge graphs (KGs) organize real-world knowledge as triplets and underpin many downstream applications.
By Zihao Zheng, Borui Cai, Yao Zhao, Keshav Sood, Yong Xiang
arXiv:2606. 11675v1 Announce Type: new Abstract: Diagnosing pulmonary diseases requires integrating heterogeneous evidence amid phenotypic variability and cross-disease overlap.
By Haoyang Zeng, Yuanxi Fu, Rongzhen Li, Yuming Yang, Xiao Sun, Jingwang Huang, Gujie Shao, Guohui Xiang, Quan Lu, Dongfan Ye, Xuetao Chen, Jiang Zhong, Kaiwen Wei, Zhi Xu
Knowledge graphs (KGs) organize real-world knowledge as triplets and underpin many downstream applications. Due to their inherent incompleteness, knowledge graph completion (KGC) is widely studied and is typically formulated as triplet prediction, with link prediction as the dominant paradigm.
PEARL is a new framework for inductive knowledge graph completion that treats relational paths as context-conditioned reasoning signals. It builds a query‑specific contextual subgraph from the query entities’ neighborhoods and uses a large language model‑guided retriever to select semantically relevant paths. By constructing a bipartite interaction graph over paths, contextual entities, and a global subgraph representation, and applying a dual‑view contrastive objective, PEARL adapts path embeddings to local and global structural evidence, achieving the best average Hits@10 on WN18RR, FB15k‑237, and NELL‑995.
By Yunchi Yang, Longlong Li, Cunquan Qu
arXiv:2605. 30747v2 Announce Type: replace Abstract: Logical rules constitute a cornerstone of knowledge graph (KG) reasoning, valued for their interpretability and ability to model relational patterns.
By Haoxiang Cheng, Yunfei Wang, Chao Chen, Kewei Cheng, Zhipeng Lin, Haoxuan Li, Changjun Fan, Shixuan Liu
arXiv:2608. 03006v1 Announce Type: new Abstract: Prerequisite relation learning is central to adaptive instruction, yet existing methods often formulate it as conventional link prediction, limiting their ability to adaptively integrate complementary educational evidence for individual candidate pairs and to discourage contradictory reverse predictions.
By Xinghe Cheng, Jiapu Wang, Chaobo He, Ruihai Dong, Quanlong Guan
The paper introduces ReSemReason, a framework for biomedical multi-hop question answering that addresses the reachable-but-invalid problem—where correct answers are retrieved but lack valid evidential support. ReSemReason aligns question-induced relation schemas with graph search and employs relation-conditioned attention and uncertainty-weighted priors to improve both answer ranking and evidence quality. Experiments on BioHopR, PrimeKGQA, and MedReason demonstrate enhanced answer-set quality and provide analyses distinguishing endpoint correctness from evidential support.
By Ziyang Ling, Ziyi Chen, Ronald X. Xu, Mingzhai Sun