Implementing Computational Law in Wolfram Language for the Governance of Artificial Intelligence

• URL: http://arxiv.org/abs/2608.13958v1
• Date: Fri, 14 Aug 2026 04:58:01 GMT
• Title: Implementing Computational Law in Wolfram Language for the Governance of Artificial Intelligence
• Abstract summary: Governance does not require understanding a system's reasoning.<n>It requires stating what the system is obliged, permitted, and forbidden to do, and checking whether it complied.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: How do we govern AI systems whose reasoning we cannot fully inspect? Governance does not require understanding a system's reasoning. It requires stating what the system is obliged, permitted, and forbidden to do, and checking whether it complied. I present an implementation of Reified Input/Output Logic, the formalism behind the DAPRECO knowledge base, in Wolfram Language: the core I/O axioms, obligations, permissions, constitutive norms, reified eventualities, and temporal operators. I then test whether GPT-4 can translate English legal statements into the formalism, and report the failures: hallucinated functions, omitted temporal scope, deviation from the formalism, and (in the worst cases) code that runs, reads plausibly, but silently encodes the wrong norm. A case study, an AI guard dog operating under a computational contract, shows how formalized rules can extend from a contract directly into the operational code of an embodied agent, producing symbolic, auditable justifications for its behaviour. I argue that computational law can be used as a governance tool and that a desirable goal would be to formalize the law that can and ought to be programmatically executable.

Related papers

• The Imitation Game: When LLMs Learn to Reason Like Programs via Code-Centric Reasoning Data Synthesis [50.473217152006875]
  MIMIC is a framework that leverages executable code as a rigorous medium for reasoning data synthesis.<n>MIMIC transforms algorithms into verifiable reasoning trajectories through narrative fusion, code-guided test synthesis, and dynamic code instrumentation.<n>Our method significantly elevates accuracy across general reasoning, complex mathematical benchmarks, and fine-grained deterministic tasks.
  arXiv  Detail & Related papers  (2026-09-13T17:04:16Z)
• Closing the Loop: Formally Verified Law as a Reward Signal for Self-Improving Legal AI [0.0]
  This article develops an architecture that creates a formally verifiable reward signal to train legal AI.<n>For the computational components of law, the architecture provides provable correctness.<n>We show that the same architecture has a structural advantage for legal AI training.
  arXiv  Detail & Related papers  (2026-06-22T20:21:49Z)
• DeonticBench: A Benchmark for Reasoning over Rules [52.69517904415795]
  DEONTICBENCH is a benchmark of 6,232 tasks across U.S. federal taxes, airline baggage policies, U.S. immigration administration, and U.S. state housing law.<n>It is a benchmark for studying context-grounded rule reasoning in real-world domains under both symbolic and non-symbolic settings.
  arXiv  Detail & Related papers  (2026-04-06T05:41:02Z)
• LawThinker: A Deep Research Legal Agent in Dynamic Environments [51.782293183431676]
  LawThinker is an autonomous legal research agent.<n>It enforces verification as an atomic operation after every knowledge exploration step.<n>LawThinker achieves a 24% improvement over direct reasoning.
  arXiv  Detail & Related papers  (2026-02-12T15:19:11Z)
• Re:Form -- Reducing Human Priors in Scalable Formal Software Verification with RL in LLMs: A Preliminary Study on Dafny [78.1575956773948]
  Large Language Models (LLMs) trained with Reinforcement Learning (RL) face a significant challenge: their verification processes are neither reliable nor scalable.<n>A promising yet largely uncharted alternative is formal language-based reasoning.<n>Grounding LLMs in rigorous formal systems where generative models operate in formal language spaces (e.g., Dafny) enables the automatic and mathematically provable verification of their reasoning processes and outcomes.
  arXiv  Detail & Related papers  (2025-07-22T08:13:01Z)
• RLJP: Legal Judgment Prediction via First-Order Logic Rule-enhanced with Large Language Models [58.69183479148083]
  Legal Judgment Prediction (LJP) is a pivotal task in legal AI.<n>Existing LJP models integrate judicial precedents and legal knowledge for high performance.<n>But they neglect legal reasoning logic, a critical component of legal judgments requiring rigorous logical analysis.<n>This paper proposes a rule-enhanced legal judgment prediction framework based on first-order logic (FOL) formalism and comparative learning (CL)
  arXiv  Detail & Related papers  (2025-05-27T14:50:21Z)
• Specification languages for computational laws versus basic legal principles [0.0]
  We speak of a textitcomputational law when that law is intended to be enforced by software through an automated decision-making process.<n>In this paper, we investigate how certain legal principles fare in both scenarios: computational law written in natural language or written in formal language.
  arXiv  Detail & Related papers  (2025-03-12T07:39:27Z)
• CUTECat: Concolic Execution for Computational Law [1.1077637528502942]
  We show how to handle default logic inside a concolic execution tool, and implement our approach in the context of Catala.<n>We evaluate the Catala implementation of the French housing benefits and Section 132 of the US tax code.
  arXiv  Detail & Related papers  (2024-10-23T18:30:23Z)
• 'Put the Car on the Stand': SMT-based Oracles for Investigating Decisions [4.170056099990699]
  We show that under minimal assumptions automated reasoning can rigorously interrogate algorithmic behaviors. We model accountability processes, such as trials or review boards, as Counterfactual-Guided Logic Exploration and Abstraction Refinement loops. We implement our framework and demonstrate its utility on an illustrative car crash scenario.
  arXiv  Detail & Related papers  (2023-05-09T19:23:47Z)
• Law Informs Code: A Legal Informatics Approach to Aligning Artificial Intelligence with Humans [0.0]
  Law-making and legal interpretation form a computational engine that converts opaque human values into legible directives. "Law Informs Code" is the research agenda capturing complex computational legal processes, and embedding them in AI.
  arXiv  Detail & Related papers  (2022-09-14T00:49:09Z)
• Learning Symbolic Rules for Reasoning in Quasi-Natural Language [74.96601852906328]
  We build a rule-based system that can reason with natural language input but without the manual construction of rules. We propose MetaQNL, a "Quasi-Natural" language that can express both formal logic and natural language sentences. Our approach achieves state-of-the-art accuracy on multiple reasoning benchmarks.
  arXiv  Detail & Related papers  (2021-11-23T17:49:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.