REVIEW 2 cited by
ChatRule: Mining Logical Rules with Large Language Models for Knowledge Graph 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
read the original abstract
Logical rules are essential for uncovering the logical connections between relations, which could improve reasoning performance and provide interpretable results on knowledge graphs (KGs). Although there have been many efforts to mine meaningful logical rules over KGs, existing methods suffer from computationally intensive searches over the rule space and a lack of scalability for large-scale KGs. Besides, they often ignore the semantics of relations which is crucial for uncovering logical connections. Recently, large language models (LLMs) have shown impressive performance in the field of natural language processing and various applications, owing to their emergent ability and generalizability. In this paper, we propose a novel framework, ChatRule, unleashing the power of large language models for mining logical rules over knowledge graphs. Specifically, the framework is initiated with an LLM-based rule generator, leveraging both the semantic and structural information of KGs to prompt LLMs to generate logical rules. To refine the generated rules, a rule ranking module estimates the rule quality by incorporating facts from existing KGs. Last, the ranked rules can be used to conduct reasoning over KGs. ChatRule is evaluated on four large-scale KGs, w.r.t. different rule quality metrics and downstream tasks, showing the effectiveness and scalability of our method.
Forward citations
Cited by 2 Pith papers
-
Graph Repairs with Large Language Models: An Empirical Study
Open-source LLMs can format graph repairs well and delete the violating edge, but exact-matching the intended repair is rare (up to 38%), and the validity metric used is trivially satisfied by deleting any edge.
-
Rethinking Regularization Methods for Knowledge Graph Completion
A selective sparsity regularizer, SPR, nudges link prediction metrics up on standard benchmarks, but the evidence is single-run and the theoretical justification is mathematically flawed.
Discussion (0). Sign in to comment.