arXiv:2507.03697cs.AI2025-07TPAMI被引 2

统一神经与符号推理,提升知识图谱多场景推理能力

Towards Unified Neurosymbolic Reasoning on Knowledge Graphs

  • 构建统一推理图结构,融合神经网络与逻辑规则
  • 在19个数据集上跨四类场景验证,性能优于现有方法
  • 适合需要多类型推理的智能系统开发者

知识图谱推理在人工智能与知识工程领域受到广泛关注,因其能自主推导新知识,从而提升下游应用的可用性与精度。然而,现有方法大多聚焦于单一神经或符号推理范式,难以有效融合二者优势;同时,多数方法仅针对特定推理场景,难以满足现实任务的多样化需求。神经与符号表示之间存在天然鸿沟,不同场景也具有差异化的知识结构与目标。为此,本文提出统一神经符号推理框架 Tunsr。Tunsr 首先构建从查询实体出发、通过迭代搜索后继邻居的统一推理图结构,再引入前向逻辑消息传递机制,同步更新节点的命题表示、注意力及一阶逻辑(FOL)表示与注意力。在此过程中,通过每一步合并可能关系实现多规则融合。最后,提出 FARI 算法,基于推理图持续进行注意力计算以诱导出 FOL 规则。在涵盖四类推理场景(直推式、归纳式、内插式、外推式)的19个数据集上的实验表明,Tunsr 具有显著有效性。

原文摘要 · Abstract (English)

Knowledge Graph (KG) reasoning has received significant attention in the fields of artificial intelligence and knowledge engineering, owing to its ability to autonomously deduce new knowledge and consequently enhance the availability and precision of downstream applications. However, current methods predominantly concentrate on a single form of neural or symbolic reasoning, failing to effectively integrate the inherent strengths of both approaches. Furthermore, the current prevalent methods primarily focus on addressing a single reasoning scenario, presenting limitations in meeting the diverse demands of real-world reasoning tasks. Unifying the neural and symbolic methods, as well as diverse reasoning scenarios in one model is challenging as there is a natural representation gap between symbolic rules and neural networks, and diverse scenarios exhibit distinct knowledge structures and specific reasoning objectives. To address these issues, we propose a unified neurosymbolic reasoning framework, namely Tunsr, for KG reasoning. Tunsr first introduces a consistent structure of reasoning graph that starts from the query entity and constantly expands subsequent nodes by iteratively searching posterior neighbors. Based on it, a forward logic message-passing mechanism is proposed to update both the propositional representations and attentions, as well as first-order logic (FOL) representations and attentions of each node. In this way, Tunsr conducts the transformation of merging multiple rules by merging possible relations at each step. Finally, the FARI algorithm is proposed to induce FOL rules by constantly performing attention calculations over the reasoning graph. Extensive experimental results on 19 datasets of four reasoning scenarios (transductive, inductive, interpolation, and extrapolation) demonstrate the effectiveness of Tunsr.

知识图谱神经符号推理

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。