Model-checking in the Foundations of Algorithmic Law and the Case of Regulation 561
Not on the map. Why?
Abstract (arXiv)
We discuss model-checking problems as formal models of algorithmic law. Specifically, we ask for an algorithmically tractable general purpose model-checking problem that naturally models the European transport Regulation 561, and discuss the reaches and limits of a version of discrete time stopwatch automata.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 11 Jul 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 1.
3 papers.
- 2024Le Nozze di Giustizia. Interactions between Artificial Intelligence, Law, Logic, Language and Computation with some case studies in Traffic Regulations and Health Carecited by 0
- 2025Specification languages for computational laws versus basic legal principlescited by 0
- 2026Coherency through formalisations of Structured Natural Language, A case study on FRETishcited by 0
- 2026Coherency through formalisations of Structured Natural Language, A case study on FRETish11 May 2026
- 2025Specification languages for computational laws versus basic legal principles12 Mar 2025
- 2024Le Nozze di Giustizia. Interactions between Artificial Intelligence, Law, Logic, Language and Computation with some case studies in Traffic Regulations and Health Care9 Feb 2024