Pith. sign in

REVIEW 2 cited by

Differentiable Learning of Logical Rules for Knowledge Base Reasoning

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 1702.08367 v3 pith:PFRWNGF6 submitted 2017-02-27 cs.AI

classification cs.AI
keywords learningdifferentiablebaseknowledgelogicalrulesfirst-orderlogic
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We study the problem of learning probabilistic first-order logical rules for knowledge base reasoning. This learning problem is difficult because it requires learning the parameters in a continuous space as well as the structure in a discrete space. We propose a framework, Neural Logic Programming, that combines the parameter and structure learning of first-order logical rules in an end-to-end differentiable model. This approach is inspired by a recently-developed differentiable logic called TensorLog, where inference tasks can be compiled into sequences of differentiable operations. We design a neural controller system that learns to compose these operations. Empirically, our method outperforms prior work on multiple knowledge base benchmark datasets, including Freebase and WikiMovies.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Neural-Symbolic Reasoning over Knowledge Graphs: A Survey from a Query Perspective

    cs.AI 2024-11 conditional novelty 3.0 of 10

    A survey of knowledge graph reasoning methods organized by query type, covering symbolic, neural, neural-symbolic, and large language model approaches.

  2. Enhancing Large Language Models with Reliable Knowledge Graphs

    cs.CL 2025-06 conditional novelty 2.0 of 10

    A thesis composed of four published papers proposes contrastive KG error detection, attribute-aware error-aware embedding, inductive graph completion, and KG prompting, but adds no new result beyond those papers.

Pith tools