arXiv:2605. 30747v2 Announce Type: replace Abstract: Logical rules constitute a cornerstone of knowledge graph (KG) reasoning, valued for their interpretability and ability to model relational patterns.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.
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.
The paper introduces the Structure-Internalized Rule Language Model (SIRLM) to improve Knowledge Graph Reasoning (KGR) by addressing the mismatch between KG structural context and Large Language Model (LLM) parametric knowledge. SIRLM centers on a Structure-Internalized Rule Generator (SIRG) that uses in-context learning, a structural relation memory, a KG tokenizer, and a neuro-symbolic reasoner to generate structural rules and provide faithful rule-execution feedback. Experiments on 36 datasets against 17 state‑of‑the‑art KGR methods show that SIRLM achieves significant performance gains.
arXiv:2607. 19996v1 Announce Type: new Abstract: Machine Learning models are widely used for automating classification tasks by extracting statistical patterns from data.
arXiv:2508. 10971v2 Announce Type: replace-cross Abstract: Knowledge graphs (KGs) can be enhanced through rule mining; however, the resulting logical rules are often difficult for humans to interpret due to their inherent complexity and the idiosyncratic labeling conventions of individual KGs.
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.
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.