Aug 2026· Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2· pp. 4357-4368· 0 citations· 31 references
TL;DR
This paper formalizes the inference from a head entity to the target tail entity as an Ordinary Differential Equation governed by a relation-conditioned neural velocity field, which learns to steer a smooth and expressive semantic transformation along the reasoning trajectory.
Abstract
Knowledge graph completion (KGC) aims to infer missing facts based on existing triplets. Traditional path-based methods formulate reasoning as a discrete multi-hop traversal, which suffers from exponential search space and error accumulation.In this paper, we propose FlowPath, which rethinks the reasoning process by transforming discrete symbolic paths into a continuous semantic flow in the latent space. Specifically, we formalize the inference from a head entity to the target tail entity as an Ordinary Differential Equation (ODE) governed by a relation-conditioned neural velocity field, which learns to steer a smooth and expressive semantic transformation along the reasoning trajectory. To prevent the continuous flow from drifting into invalid semantic regions, we further introduce a structure-anchored guidance mechanism that leverages factual multi-hop paths from the knowledge graph as topological constraints, grounding the learned flow in the discrete relational structure. Moreover, a uncertainty weighting strategy is employed to adaptively balance the joint optimization of link prediction, flow generation, and structural guidance. By bridging discrete symbolic paths and continuous neural dynamics, FlowPath inherits the interpretability of path-based reasoning while possessing the flexibility and expressiveness of generative modeling. Extensive experiments on benchmark datasets demonstrate that FlowPath achieves competitive performance, and additional analysis confirms the effectiveness of modeling the reasoning paths of KGC as a continuous semantic flow.
A knowledge graph completion model based on semantic constrained hybrid scoring (SCHS) is proposed, which integrates three synergistic mechanisms that essentially resolves the rigid trade-off between geometric alignment and flexible semantic matching.
Pengsong Duan, Jia-Ke Zhao, Bo Zhang et al.· International journal of sof...· 0 citations
This work re-frame multi-hop KGQA as a question-conditioned graph navigation problem, and refers to this formulation as THESEUS - Traceable Hop-wise Evidence SEarch in a Unified Semantics, advancing KGQA research toward systems where traceability is fundamental.
Eduin E. Hernandez, Luis F. Garcia, Nurassyl Askar et al.· 1 citation· ⚡1
PEARL is proposed, a Path-Entity Aligned Relational Learning framework that models paths as context-conditioned reasoning signals and employs a dual-view contrastive objective that promotes representation consistency under stochastic contextual perturbations.
Temporal knowledge graph (TKG) reasoning is critical for modeling and forecasting the evolution of real-world events. Existing TKG construction pipelines transform raw text into structured temporal quadruples as graph facts. However, in this process, they often fail to preserve reasoning-relevant contextual semantics f...
Ze-Shu Tian, J. Tao, Hong-Li Zhang· Proceedings of the Thirty-Fi...· 0 citations
These results demonstrate that collaborative modeling of instance-level and batch-level structural context can effectively enhance structure-aware entity representation and improve fine-grained entity prediction.