Explainable Rule Application via Structured Prompting: A Neural-Symbolic Approach
Albert Sadowski, Jaros{\l}aw A. Chudziak

TL;DR
This paper presents a neural-symbolic framework using structured prompting to improve rule application, consistency, and explainability in large language models, demonstrated on legal reasoning tasks with significant performance gains.
Contribution
It introduces a structured prompting method that decomposes reasoning into verifiable steps, combining neural and symbolic approaches for transparent and consistent rule-based reasoning.
Findings
Achieved an F1 score of 0.929 on LegalBench hearsay task with o1 model.
Outperformed baseline few-shot models significantly.
Demonstrated improved explainability and logical consistency in legal reasoning.
Abstract
Large Language Models (LLMs) excel in complex reasoning tasks but struggle with consistent rule application, exception handling, and explainability, particularly in domains like legal analysis that require both natural language understanding and precise logical inference. This paper introduces a structured prompting framework that decomposes reasoning into three verifiable steps: entity identification, property extraction, and symbolic rule application. By integrating neural and symbolic approaches, our method leverages LLMs' interpretive flexibility while ensuring logical consistency through formal verification. The framework externalizes task definitions, enabling domain experts to refine logical structures without altering the architecture. Evaluated on the LegalBench hearsay determination task, our approach significantly outperformed baselines, with OpenAI o-family models showing…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
