Jiraporn Pooksook, P. M. Dung, K. Satoh, G. Sartor
{"title":"刑法中最后行为未遂的建模","authors":"Jiraporn Pooksook, P. M. Dung, K. Satoh, G. Sartor","doi":"10.1080/11663081.2019.1647652","DOIUrl":null,"url":null,"abstract":"ABSTRACT In the court of law, a person can be punished for attempting to commit a crime. An open issue in the study of Artificial Intelligence and Law is whether the law of attempts could be formally modelled. There are distinct legal rules for determining attempted crime whereas the last-act rule (also called proximity rule) represents the strictest approach. In this paper, we provide a formal model of the last-act rule using structured argumentation.","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"32 1","pages":"327 - 357"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Modelling last-act attempted crime in criminal law\",\"authors\":\"Jiraporn Pooksook, P. M. Dung, K. Satoh, G. Sartor\",\"doi\":\"10.1080/11663081.2019.1647652\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT In the court of law, a person can be punished for attempting to commit a crime. An open issue in the study of Artificial Intelligence and Law is whether the law of attempts could be formally modelled. There are distinct legal rules for determining attempted crime whereas the last-act rule (also called proximity rule) represents the strictest approach. In this paper, we provide a formal model of the last-act rule using structured argumentation.\",\"PeriodicalId\":38573,\"journal\":{\"name\":\"Journal of Applied Non-Classical Logics\",\"volume\":\"32 1\",\"pages\":\"327 - 357\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Applied Non-Classical Logics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/11663081.2019.1647652\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Arts and Humanities\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied Non-Classical Logics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/11663081.2019.1647652","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Arts and Humanities","Score":null,"Total":0}
Modelling last-act attempted crime in criminal law
ABSTRACT In the court of law, a person can be punished for attempting to commit a crime. An open issue in the study of Artificial Intelligence and Law is whether the law of attempts could be formally modelled. There are distinct legal rules for determining attempted crime whereas the last-act rule (also called proximity rule) represents the strictest approach. In this paper, we provide a formal model of the last-act rule using structured argumentation.