Toward Robust Legal Text Formalization into Defeasible Deontic Logic using LLMs
Not on the map. Why?
Abstract (arXiv)
We present a comprehensive approach to the automated formalization of legal texts using large language models (LLMs), targeting their transformation into Defeasible Deontic Logic (DDL). Our method employs a structured pipeline that segments complex normative language into atomic snippets, extracts deontic rules, and evaluates them for syntactic and semantic coherence. We introduce a refined success metric that more precisely captures the completeness of formalizations, and a novel two-stage pipeline with a dedicated refinement step to improve logical consistency and coverage. The evaluation procedure has been strengthened with stricter error assessment, and we provide comparative results across multiple LLM configurations, including newly released models and various prompting and fine-tuning strategies. Experiments on legal norms from the Australian Telecommunications Consumer Protections Code demonstrate that, when guided effectively, LLMs can produce formalizations that align closely with expert-crafted representations, underscoring their potential for scalable legal informatics.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 7 of its 32 references that are in the map. First posted on arXiv 10 Jun 2025.
Builds on
7 of 32 references.
References · 7
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,780
- 2019The Curious Case of Neural Text Degenerationcited by 2,916
- 2024Towards Reproducible LLM Evaluation: Quantifying Uncertainty in LLM Benchmark Scorescited by 25
- 2024Optimizing Large Language Model Hyperparameters for Code Generationcited by 11
- 2024Layer-of-Thoughts Prompting (LoT): Leveraging LLM-Based Retrieval with Constraint Hierarchiescited by 6
- 2025Explainability by design: an experimental analysis of the legal coding processcited by 1
Built on by
Citing papers per year: 2026: 2.
2 papers.