首页 | 本学科首页   官方微博 | 高级检索  
     


A Goal-Dependent Abstraction for Legal Reasoning by Analogy
Authors:Tokuyasu Kakuta  Makoto Haraguchi  Yoshiaki Okubo
Affiliation:(1) Department of Systems Science, Tokyo Institute of Technology, 4259 Nagatsuta, Midori-ku, Yokohama, 226, Japan;(2) Division of Electronics and Information Engineering, Hokkaido University, N-13, W-8, Sapporo, 060, Japan
Abstract:This paper presents a new algorithm to find an appropriate similarityunder which we apply legal rules analogically. Since there may exist a lotof similarities between the premises of rule and a case in inquiry, we haveto select an appropriate similarity that is relevant to both thelegal rule and a top goal of our legal reasoning. For this purpose, a newcriterion to distinguish the appropriate similarities from the others isproposed and tested. The criterion is based on Goal-DependentAbstraction(GDA) to select a similarity such that an abstraction basedon the similarity never loses the necessary information to prove the ground (purpose of legislation) of the legal rule. In order to cope withour huge space of similarities, our GDA algorithm uses some constraintsto prune useless similarities.
Keywords:legal reasoning  analogy  similarity  order-sorted logid  taxonomic hierarchy  goal-dependent abstraction
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号