Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Law
Automating Defeasible Reasoning In Law With Answer Set Programming, How Khang Lim, Avishkar Mahajar, Martin Strecker, Meng Weng Wong
Automating Defeasible Reasoning In Law With Answer Set Programming, How Khang Lim, Avishkar Mahajar, Martin Strecker, Meng Weng Wong
Centre for Computational Law
The paper studies defeasible reasoning in rule-based systems, in particular about legal norms and contracts. We identify rule modifiers that specify how rules interact and how they can be overridden. We then define rule transformations that eliminate these modifiers, leading in the end to a translation of rules to formulas. For reasoning with and about rules, we contrast two approaches, one in a classical logic with SMT solvers, which is only briefly sketched, and one using non-monotonic logic with Answer Set Programming solvers, described in more detail.
Towards Cnl-Based Verbalization Of Computational Contracts, Inari Listenmaa, Maryam Hanafiah, Regina Cheong, Andreas Kallberg
Towards Cnl-Based Verbalization Of Computational Contracts, Inari Listenmaa, Maryam Hanafiah, Regina Cheong, Andreas Kallberg
Centre for Computational Law
We present a CNL, which is a component of L4, a domain-specific programming language for drafting laws and contracts. Along with formal verification, L4’s core functionalities include natural language generation. We present the NLG pipeline and an interactive process for ambiguity resolution.