On the Formal Representation of the Australian Spent Conviction Scheme
View/ Open
File version
Accepted Manuscript (AM)
Author(s)
Governatori, G
Romeu, PC
de Koker, L
Griffith University Author(s)
Year published
2020
Metadata
Show full item recordAbstract
We discuss how to use Defeasible Deontic Logic to provide a formal representation of the Commonwealth of Australia spent conviction schema (Part VII C of the Crimes Act (1914)). The formalisation is directly written and implemented in Turnip (a modern implementation of Defeasible Deontic Logic).We discuss how to use Defeasible Deontic Logic to provide a formal representation of the Commonwealth of Australia spent conviction schema (Part VII C of the Crimes Act (1914)). The formalisation is directly written and implemented in Turnip (a modern implementation of Defeasible Deontic Logic).
View less >
View less >
Conference Title
Lecture Notes in Computer Science
Volume
12173
Copyright Statement
© Springer Nature Switzerland AG 2020. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher.The original publication is available at www.springerlink.com
Subject
Theory of computation
Distributed computing and systems software
Decision support and group support systems