arXiv AI

Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets

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.

arXiv AI
Aug 25

SLogic: Subgraph-Informed Logical Rule Learning for Knowledge Graph Completion

SLogic introduces a subgraph-informed approach to logical rule learning for knowledge graph completion, assigning query-dependent scores to rules instead of a single global weight. The framework uses a context-aware scoring function that evaluates the importance of a rule based on the local subgraph around the query’s head entity, aligning with the specificity principle of commonsense reasoning. Experiments on benchmark datasets demonstrate that SLogic performs competitively with other rule-based methods while producing human-readable, query-specific explanations.

By Trung Hoang Le, Tran Cao Son, Ishtiaq Ahmed, Huiping Cao
arXiv Computation and Language
Aug 25

Beyond Factual Knowledge: Benchmarking and Learning Step-Level Procedural Rule Reasoning in Large Language Models

arXiv:2608.22753v1 Announce Type: new Abstract: Large language models (LLMs) excel at text understanding and generation, yet still struggle to reliably understand and apply externally provided proced...

By Bohan Yu, Pengfei Cao, Chen Han, Chenxi Zhou, Zhiheng Zhang, Zhiyang Xie, Wenhao Teng, Xiangwen Liao, Jun Zhao, Kang Liu
arXiv Computation and Language
Aug 28

RuleWeaver: Benchmarking Rule-Centered Scenario Reasoning for Large Language Models

RuleWeaver is a benchmark construction framework designed to evaluate large language models’ ability to reason over complex, rule‑centered scenarios. It begins with corpus‑derived IF‑THEN meta rules, expands them into more intricate rules, and composes these into scenario‑based QA instances. The benchmark assesses not only final answer correctness but also process‑level metrics such as rubric‑based answer quality, rule recall, and rule precision, revealing that current LLMs achieve only about 50% of the maximum rubric score on these tasks.

By Bohan Yu, Shi-Yang Li, Pengfei Cao, Jun Zhao, Kang Liu
arXiv AI
Aug 19

From Abductive Explanations to Global Logical Rules for Node Classification in SGCs

The paper introduces a logic-based framework that extracts global logical rules for node classification in Simple Graph Convolution (SGC) networks. It uses minimal abductive explanations—small sets of node-feature pairs that preserve a node’s predicted class—as an intermediate step. Decision trees trained on these explanations yield compact global rules that retain high fidelity to the original SGC model, as demonstrated on benchmark datasets.

By Bryan Lima Cavalcante, Thiago Alves Rocha