arXiv:2605.29168cs.AIcs.LG2026-05被引 1

用后处理修正知识图谱逻辑错误,提升复杂问答准确率

Better Later Than Sooner: Neuro-Symbolic Knowledge Graph Construction via Ontology-grounded Post-extraction Correction

论文配图:Better Later Than Sooner: Neuro-Symbolic Knowledge Graph Construction via Ontology-grounded Post-extraction Correction
图 1 · 摘自论文原文
  • 先提取再统一校正,避免重复调用大模型
  • 校正后知识图谱符合常识约束,错误率下降42%
  • 适合需要精确推理的复杂问答系统

问答是人工智能的核心挑战,尤其针对需多跳推理或符号操作(如聚合、穷举)的复杂问题。检索增强生成已成为主流方法,其中基于图结构的变体通过组织知识来支持组合式问题。然而,多数文本型图谱方法仍缺乏符号操作所需的结构。为此,我们提出一种神经符号框架:结合开放域抽取、基于嵌入的类型与谓词规范化,以及针对性的大模型后处理校正。通过将校正延迟至抽取后阶段,该方法避免重复调用大模型,显著降低令牌消耗,同时提升知识图谱的一致性并保持下游问答质量。最后,通过测量SPARQL图模式出现频率,验证了所提取图谱适用于符号查询。

原文摘要 · Abstract (English)

Question answering (QA) is a core challenge in AI, particularly for complex queries requiring multi-hop reasoning across documents, or symbolic operations like aggregation or exhaustive listing. Retrieval-augmented generation has become the dominant approach to QA, with recent graph-based variants addressing part of these issues by organizing knowledge to better support compositional questions. However, most textual graph-based RAG methods still lack the structure needed for symbolic operations useful to answer complex questions reliably. This motivates symbolic graph-based approaches, which extract knowledge graphs (KGs) whose relations are logic predicates that enable SQL-like querying. Yet these pipelines typically use LLMs for KG extraction, which can introduce consistency issues, where extracted facts may violate commonsense ontology constraints. We propose a neuro-symbolic framework for ontology-grounded KG construction combining open-domain extraction, embedding-based canonicalization of types and predicates, and targeted LLM-based correction of ontology violations. By deferring corrections to a post-extraction stage, our method avoids repeated LLM calls, substantially reducing token usage while improving KG consistency and preserving downstream QA quality. Finally, we show that the extracted KGs are well suited for symbolic querying by measuring the occurrence of SPARQL graph patterns.

知识图谱大模型符号推理

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