Pith. sign in

REVIEW 3 cited by

RNNLogic: Learning Logic Rules for Reasoning on Knowledge Graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2010.04029 v2 pith:K25FN3EP submitted 2020-10-08 cs.AI cs.LG

classification cs.AIcs.LG
keywords ruleslogicreasoningrnnlogicgeneratorlearningpredictorrule
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper studies learning logic rules for reasoning on knowledge graphs. Logic rules provide interpretable explanations when used for prediction as well as being able to generalize to other tasks, and hence are critical to learn. Existing methods either suffer from the problem of searching in a large search space (e.g., neural logic programming) or ineffective optimization due to sparse rewards (e.g., techniques based on reinforcement learning). To address these limitations, this paper proposes a probabilistic model called RNNLogic. RNNLogic treats logic rules as a latent variable, and simultaneously trains a rule generator as well as a reasoning predictor with logic rules. We develop an EM-based algorithm for optimization. In each iteration, the reasoning predictor is first updated to explore some generated logic rules for reasoning. Then in the E-step, we select a set of high-quality rules from all generated rules with both the rule generator and reasoning predictor via posterior inference; and in the M-step, the rule generator is updated with the rules selected in the E-step. Experiments on four datasets prove the effectiveness of RNNLogic.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Context-Driven Knowledge Graph Completion with Semantic-Aware Relational Message Passing

    cs.AI 2025-06 conditional novelty 5.0 of 10

    SARMP improves knowledge graph link prediction by selecting the Top-K semantically relevant edges per node and aggregating them with multi-head attention, beating some baselines on FB15k-237 and Kinship but not all be...

  2. Flow-Modulated Scoring for Semantic-Aware Knowledge Graph Completion

    cs.CL 2025-06 reject novelty 5.0 of 10

    A relation-prediction model that combines top-K edge message passing with a conditional flow matching auxiliary loss, reporting near-perfect relation prediction and a 25% relative MRR gain in entity prediction.

  3. Interpretable Hierarchical Concept Reasoning through Attention-Guided Graph Learning

    cs.LG 2025-06 conditional novelty 5.0 of 10

    H-CMR is a concept-based classifier whose concept and task predictions are made by attention-selected logic rules over a learned acyclic concept graph.

Pith tools