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

RNNLogic: Learning Logic Rules for Reasoning on Knowledge Graphs

classification cs.AI cs.LG
keywords ruleslogicreasoningrnnlogicgeneratorlearningpredictorrule
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
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 with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

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

  1. EHRAG: Bridging Semantic Gaps in Lightweight GraphRAG via Hybrid Hypergraph Construction and Retrieval

    cs.AI 2026-04 unverdicted novelty 6.0

    EHRAG constructs structural hyperedges from sentence co-occurrence and semantic hyperedges from entity embedding clusters, then applies hybrid diffusion plus topic-aware PPR to retrieve top-k documents, outperforming ...

  2. Interactive Query Answering on Knowledge Graphs with Soft Entity Constraints

    cs.AI 2025-08 unverdicted novelty 5.0

    The paper formalizes query answering with soft constraints on knowledge graphs and introduces two lightweight methods (parameter tuning or small neural network) to incorporate them while preserving original rankings.

  3. Inferring Sensitive Attributes from Knowledge Graph Embeddings: Attack and Defense Strategies

    cs.CR 2026-05 unverdicted novelty 4.0

    Attribute inference attacks succeed on KGE outputs and randomization-based sanitization offers partial mitigation at the cost of recommendation utility.