This paper analyses and compares some of the automated reasoners that have been used in recent research for compliance checking. Although the list of the considered reasoners is not exhaustive, we believe that our analysis is representative enough to take stock of the current state of the art in the topic. We are interested here in formalizations at the first-order level. Past literature on normative reasoning mostly focuses on the propositional level. However, the propositional level is of little usefulness for concrete LegalTech applications, in which compliance checking must be enforced on (large) sets of individuals. Furthermore, we are interested in technologies that are freely available and that can be further investigated and compared by the scientific community. In other words, this paper does not consider technologies only employed in industry and/or whose source code is non-accessible. This paper formalizes a selected use case in the considered reasoners and compares the implementations, also in terms of simulations with respect to shared synthetic datasets. The comparison will highlight that lot of further research still needs to be done to integrate the benefits featured by the different reasoners into a single standardized first-order framework, suitable for LegalTech applications. All source codes are freely available at https://github.com/liviorobaldo/compliancecheckers, together with instructions to locally reproduce the simulations.
Different formalisms for defeasible reasoning have been used to represent knowledge and reason in the legal field. In this work, we provide an overview of the following logic-based approaches to defeasible reasoning: defeasible logic, Answer Set Programming, ABA+, ASPIC+, and DeLP. We compare features of these approaches under three perspectives: the logical model (knowledge representation), the method (computational mechanisms), and the technology (available software resources). On top of that, two real examples in the legal domain are designed and implemented in ASPIC+ to showcase the benefit of an argumentation approach in real-world domains. The CrossJustice and Interlex projects are taken as a testbed, and experiments are conducted with the Arg2P technology.
Private international law (PIL) addresses overlaps and conflicts between legal systems by distributing cases between the authorities of such systems (jurisdiction) and establishing what rules these authorities have to apply to each case(choice of law). A modular argumentation tool, Arg-tuProlog, is here presented that enables reasoning with rules and interpretations of multiple legal systems.
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.