REVIEW 10 cited by
Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models
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
Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models
read the original abstract
Large language models (LLMs) have demonstrated impressive reasoning abilities, but they still struggle with faithful reasoning due to knowledge gaps and hallucinations. To address these issues, knowledge graphs (KGs) have been utilized to enhance LLM reasoning through their structured knowledge. However, existing KG-enhanced methods, either retrieval-based or agent-based, encounter difficulties in accurately retrieving knowledge and efficiently traversing KGs at scale. In this work, we introduce graph-constrained reasoning (GCR), a novel framework that bridges structured knowledge in KGs with unstructured reasoning in LLMs. To eliminate hallucinations, GCR ensures faithful KG-grounded reasoning by integrating KG structure into the LLM decoding process through KG-Trie, a trie-based index that encodes KG reasoning paths. KG-Trie constrains the decoding process, allowing LLMs to directly reason on graphs and generate faithful reasoning paths grounded in KGs. Additionally, GCR leverages a lightweight KG-specialized LLM for graph-constrained reasoning alongside a powerful general LLM for inductive reasoning over multiple reasoning paths, resulting in accurate reasoning with zero reasoning hallucination. Extensive experiments on several KGQA benchmarks demonstrate that GCR achieves state-of-the-art performance and exhibits strong zero-shot generalizability to unseen KGs without additional training.
Forward citations
Cited by 10 Pith papers
-
Leveraging Trajectory Graphs for Pre-Execution Error Diagnosis in Agentic LLM Systems
Modeling agent trajectories as action-centric probabilistic graphs lets a GNN warn LLM agents of likely step-level errors before execution, improving pass ratio ~14.7% across four benchmarks.
-
TRIAGE: Trustworthy Retrieval Instrumentation And Graph Evaluation
TRIAGE instruments Graph-RAG with gold-free stage metrics and a usage-time diagnostic chain that localizes failures to extraction, graph/schema, or retrieval levers.
-
Graph-Grounded Optimization: Rao-Family Metaheuristics, Classical OR, and SLM-Driven Formulation over Knowledge Graphs
Graph-grounded optimization sources problem elements from knowledge graphs and shows Rao-family metaheuristics plus OR-tools perform differently across seven real-world KG-backed problems while surfacing data issues.
-
Graph-Grounded Optimization: Rao-Family Metaheuristics, Classical OR, and SLM-Driven Formulation over Knowledge Graphs
Graph-grounded optimization pulls problem elements from knowledge graphs via Cypher and shows that a portfolio of Rao-family metaheuristics outperforms single variants while OR-tools fails on non-linear objectives tha...
-
To Know is to Construct: Schema-Constrained Generation for Agent Memory
SCG-MEM reformulates agent memory access as schema-constrained generation within dynamic cognitive schemas, using assimilation and accommodation for updates plus an associative graph for reasoning, and outperforms ret...
-
Constrained Path Reasoning: Measuring When Committed Stages Earn Their Cost
Committed LLM stages earn their cost when gains exceed propagated error and execution cost; in a convexification case study, formalization plus solver reached 90% usable yield versus 41% direct, and residual triage re...
-
Scientific Knowledge-driven Decoding Constraints Improving the Reliability of LLMs
SciDC turns flexible scientific knowledge into standardized decoding constraints via LLMs, delivering a 12% average accuracy gain over vanilla generation on tasks including formulation design, tumor diagnosis, and ret...
-
RELOOP: Recursive Retrieval with Multi-Hop Reasoner and Planners for Heterogeneous QA
RELOOP unifies retrieval across text, tables, and KGs via hierarchical sequences and dual-agent guided iteration, reporting EM/F1 gains over baselines on HotpotQA, HybridQA/TAT-QA, and MetaQA.
-
Retrieval-Augmented Generation with Graphs (GraphRAG)
A survey proposing a holistic GraphRAG framework with components including query processor, retriever, organizer, generator, and data source, plus domain-tailored reviews, challenges, and future directions.
-
LLMs+Graphs: Toward Graph-Native, Synergistic AI Systems
The paper synthesizes three synergies between LLMs and graphs—augmented retrieval/reasoning, bidirectional KG integration, and graph-enhanced agents—plus LLM uses in graph data management and ML.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.