mlsanityData to 14 Oct 2026

Cumulative Path-Level Semantic Reasoning for Inductive Knowledge Graph Completion

arXiv 2601.05629 ↗First posted 9 Jan 2026cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Conventional Knowledge Graph Completion (KGC) methods aim to infer missing information in incomplete Knowledge Graphs (KGs) by leveraging existing information, which struggle to perform effectively in scenarios involving emerging entities. Inductive KGC methods can handle the emerging entities and relations in KGs, offering greater dynamic adaptability. While existing inductive KGC methods have achieved some success, they also face challenges, such as susceptibility to noisy structural information during reasoning and difficulty in capturing long-range dependencies in reasoning paths. To address these challenges, this paper proposes the Cumulative Path-Level Semantic Reasoning for inductive knowledge graph completion (CPSR) framework, which simultaneously captures both the structural and semantic information of KGs to enhance the inductive KGC task. Specifically, the proposed CPSR employs a query-dependent masking module to adaptively mask noisy structural information while retaining important information closely related to the targets. Additionally, CPSR introduces a global semantic scoring module that evaluates both the individual contributions and the collective impact of nodes along the reasoning path within KGs. The experimental results demonstrate that CPSR achieves state-of-the-art performance.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 13 of its 23 references that are in the map. First posted on arXiv 9 Jan 2026.

Builds on

13 of 23 references.

References · 13

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2020Graph Contrastive Learning with Adaptive Augmentationcited by 519
  3. 2021Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Predictioncited by 275
  4. 2019DRUM: End-To-End Differentiable Rule Mining On Knowledge Graphscited by 175
  5. 2018Canonical Tensor Decomposition for Knowledge Base Completioncited by 150
  6. 2021Knowledge Graph Reasoning with Relational Digraphcited by 92
  7. 2022A*Net: A Scalable Path-based Reasoning Approach for Knowledge Graphscited by 49
  8. 2021Topology-Aware Correlations Between Relations for Inductive Link Prediction in Knowledge Graphscited by 48
  9. 2024Learning from Teaching Regularization: Generalizable Correlations Should be Easy to Imitatecited by 47
  10. 2022Contrastive Meta Learning with Behavior Multiplicity for Recommendationcited by 37
  11. 2024Atomic Fact Decomposition Helps Attributed Question Answeringcited by 21
  12. 2025AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learningcited by 14
1 more
  1. 2022Link Prediction with Contextualized Self-Supervisioncited by 4

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2024Query-Enhanced Adaptive Semantic Path Reasoning for Inductive Knowledge Graph Completion
  2. 2024Context-aware Inductive Knowledge Graph Completion with Latent Type Constraints and Subgraph Reasoning
  3. 2024One Subgraph for All: Efficient Reasoning on Opening Subgraphs for Inductive Knowledge Graph Completion
  4. 2024Logical Reasoning with Relation Network for Inductive Knowledge Graph Completion
  5. 2025Soft Reasoning Paths for Knowledge Graph Completion
  6. 2025Enhancing Knowledge Graph Completion with Entity Neighborhood and Relation Context
  7. 2024GS-KGC: A Generative Subgraph-based Framework for Knowledge Graph Completion with Large Language Models
  8. 2025Knowledge Reasoning Language Model: Unifying Knowledge and Language for Inductive Knowledge Graph Reasoning