REVIEW 6 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
Signed reviews
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 6 Pith papers
-
Adapting to Non-Stationary Environments: Multi-Armed Bandit Enhanced Retrieval-Augmented Generation on Knowledge Graphs
A multi-armed bandit router that selects knowledge-graph retrieval methods and adapts online to non-stationary conditions improves KGQA accuracy and latency over static baselines.
-
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.
-
WALL-E 2.0: World Alignment by NeuroSymbolic Learning improves World Model-based LLM Agents
WALL-E 2.0 improves LLM agents by encoding learned environment rules as executable code that corrects an LLM world model, lifting ALFWorld success to 98%.
-
Efficient Relational Context Perception for Knowledge Graph Completion
A knowledge graph completion model that processes each triple through RWKV-style mixing layers and a Tucker decoder reports state-of-the-art or near-state-of-the-art scores on FB15k, YAGO3-10, UMLS, and FB13.
-
A Survey on Retrieval And Structuring Augmented Generation with Large Language Models
The paper presents a comprehensive survey and taxonomy of RAS methods, covering retrieval, text structuring, and LLM integration.
Discussion (0). Continue with ORCID to comment.