Chain of Prompts and Memories for Accessible Symbolic Applications in the Legal Domain

This article introduces a novel hybrid approach that enhances the accessibility and explainability of symbolic legal systems by integrating them with large language models (LLMs). While symbolic systems provide transparency and justifiability, they suffer from communicability issues and limitations in knowledge representation. Conversely, LLMs offer natural language fluency but struggle with reliability and justifiability in legal reasoning. The article bridges this gap by structuring legal tasks into a modular, interconnected sequence of prompts, supported by contextually relevant memory retrieval, thus creating a chain of prompts and memories. The methodology is validated through two case studies. The first applies it to computable contracts, demonstrating its ability to map code to contractual provisions, thereby making them more accessible. The second case study involves an expert legal system, where the hybrid approach generates accessible explanations of Prolog-based legal reasoning. The findings show that the hybrid approach enhances the clarity and interpretability of legal applications while preserving justifiability, using a modular structure that allows for adaptability across different legal tasks.

Authors

Institutions

Publication Details

Journal
Law Technology and Humans
Published
2025-09-21
DOI
https://doi.org/10.5204/lthj.4010
Citations
1
Primary Topic
Model-Driven Software Engineering Techniques
Type
article
Field-Weighted Citation Impact
2.31
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Chain of Prompts and Memories for Accessible Symbolic Applications in the Legal Domain

Marco Billi, Giuseppe Pisano, Marco Sanchi, Alessandro Parenti
1 citations
Law Technology and Humans
Model-Driven Software Engineering Techniques
2.31
article

Chain of Prompts and Memories for Accessible Symbolic Applications in the Legal Domain

Marco Billi, Giuseppe Pisano, Marco Sanchi, Alessandro Parenti
article en
1 citations

Abstract

This article introduces a novel hybrid approach that enhances the accessibility and explainability of symbolic legal systems by integrating them with large language models (LLMs). While symbolic systems provide transparency and justifiability, they suffer from communicability issues and limitations in knowledge representation. Conversely, LLMs offer natural language fluency but struggle with reliability and justifiability in legal reasoning. The article bridges this gap by structuring legal tasks into a modular, interconnected sequence of prompts, supported by contextually relevant memory retrieval, thus creating a chain of prompts and memories. The methodology is validated through two case studies. The first applies it to computable contracts, demonstrating its ability to map code to contractual provisions, thereby making them more accessible. The second case study involves an expert legal system, where the hybrid approach generates accessible explanations of Prolog-based legal reasoning. The findings show that the hybrid approach enhances the clarity and interpretability of legal applications while preserving justifiability, using a modular structure that allows for adaptability across different legal tasks.

Law Technology and Humans
University of Bologna (IT)
Openalex Percentile: Top 10%
Model-Driven Software Engineering Techniques
2.31
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Chain of Prompts and Memories for Accessible Symbolic Applications in the Legal Domain — Marco Billi, Giuseppe Pisano, et al. · Law Technology and Humans (2025) | TGRS Research Map | TGRS