Falkor-IRAC: Graph-Constrained Generation for Verified Legal Reasoning in Indian Judicial AI
Joy Bose

TL;DR
Falkor-IRAC introduces a graph-constrained generation framework for Indian legal AI, grounding LLM outputs in structured reasoning over a knowledge graph to improve citation accuracy and conflict detection.
Contribution
The paper presents a novel graph-based reasoning approach for legal AI that enforces valid support paths and detects conflicts, addressing hallucination issues in LLMs.
Findings
Verifier Agent correctly validated citations in 51 judgments
System rejected fabricated citations effectively
Graph-native metrics outperform BLEU and ROUGE for evaluation
Abstract
Legal reasoning is not semantic similarity search. A court judgment encodes constrained symbolic reasoning: precedent propagation, procedural state transitions, and statute-bound inference. These are properties that vector-based retrieval-augmented generation (RAG) cannot faithfully represent. Hallucinated precedents, outdated statute citations, and unsupported reasoning chains remain persistent failure modes in LLM-based legal AI, with real consequences for access to justice in high-caseload jurisdictions such as India. This paper presents Falkor-IRAC, a graph-constrained generation framework for Indian legal AI that grounds generation in structured reasoning over an IRAC (Issue, Rule, Analysis, Conclusion) knowledge graph. Judgments from the Supreme Court and High Courts of India are ingested as IRAC node structures enriched with procedural state transitions, precedent relationships,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
