Projects
Stanford CodeX’s Insurance Initiative Project
The Centre has partnered with …
Research Project in Computational Law
The Centre’s anchor research programme aims to create and design a common language for law. With such a…
Papers
Defeasible Semantics for L4
The importance of defeasibility for legal reasoning has been investigated for a long time (see among other [10, 3, 11]). This notion mostly…
Traffic Rule Formalization for Autonomous Vehicle
This study devised and implemented a Defeasible Deontic Logic (DDL)-based formalization approach for translating traffic rules into a machine-…
Driving-Decision Making of Autonomous Vehicle according to Queensland Overtaking Traffic Rules
Making a driving decision according to traffic rules is a challenging task for improving the safety of Autonomous Vehicles (AVs). Traffic rules…
Compliance through Model Checking
In this short note, we describe part of a case study about Singapore’s Personal Data Protection Act, which we first presented informally, then…
An End-to-End Pipeline from Law Text to Logical Formulas
This paper develops a pipeline for converting natural English law texts into logical formulas via a series of structural representations. The goal…
User Guided Abductive Proof Generation for Answer Set Programming Queries
We present a method for generating possible proofs of a query with respect to a given Answer Set Programming (ASP) rule set using an abductive…
Automating Defeasible Reasoning in Law
The paper studies defeasible reasoning in rule-based systems, in particular about legal norms and contracts.…
Towards CNL-based Verbalization of Computational Contracts
At CCLAW, our work aims at computerizing legal reasoning in a manner that is both formally precise and intuitively accessible to legal experts.…
Constraint Answer Set Programming as a Tool to Improve Legislative Drafting
"Rules as Code" in this paper is used to refer to a proposed methodology of legislative and regulatory drafting.1 That legislation can be…