English(EN) Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets

概率电路将知识图谱规则减少96%，同时提升性能

作者 PulseAugur 编辑部 · [1 个来源] · 2026-08-11 04:00

研究人员开发了一种新颖的概率电路方法，可显著减少知识图谱补全所需的规则数量。该方法实现了70-96%的规则集缩减，并在规则最少的情况下，性能比基线方法高出31倍。该新框架基于Nilsson的概率逻辑，显示出更高的规则利用率，并在比较最少规则集与完整规则集时，保留了91%的基线峰值性能。 AI

影响这项研究通过降低知识图谱中基于规则推理的复杂性，有望带来更高效、更易于理解的AI系统。

排序理由关于知识图谱补全新方法的学术论文。[lever_c_demoted from research: ic=1 ai=1.0]

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 0 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 关于知识图谱补全新方法的学术论文。[lever_c_demoted from research: ic=1 ai=1.0]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: High; Clearly on-topic for AI-industry coverage.
Story freshness: 59 days old; Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

完整方法见我们的编辑标准。

arXiv cs.AI TIER_1 English(EN) · Jaikrishna Manojkumar Patil, Nathaniel Lee, Al Mehdi Saadat Chowdhury, YooJung Choi, Paulo Shakarian · 2026-08-11 04:00

用于知识图谱补全的概率电路与简化规则集

arXiv:2508.06706v2 Announce Type: replace Abstract: Rule-based methods for knowledge graph completion provide explainable results, but often require tens of thousands of rules to achieve competitive performance. Although individual predictions may use only a few rules, reasoning …