JACIII Vol.1 No.2 pp. 94-103
doi: 10.20965/jaciii.1997.p0094


Statutory Interpretation by Case-Based Reasoning through Abductive Logic Programming

Ken Satoh

Division of Electronics and Information Enginnering, Hokkaido University, N-13 W-8, Sapporo, 060, Japan

October 3, 1997
November 13, 1997
December 20, 1997
Case-based reasoning, Dynamic Similarity, Abductive Logic Programming, Legal reasoning
This paper presents a method for solving statutory interpretation problem in the legal domain by using abductive logic programming. To interpret a rule, we must make an interpretation for legal predicates and terms in the rule; this interpretation is subject to change according to context. In this paper, we solve this problem byomparing and contrasting cases such as the CABARET system. This is done by translating case-based reasoning into abductive logic programming so that similarity between cases with respect to every undefined proposition in the rule is regarded as a set of abducibles that can be changed according to context. Our method is sound and complete in the sense that every possible interpretation is computed exactly.
Cite this article as:
K. Satoh, “Statutory Interpretation by Case-Based Reasoning through Abductive Logic Programming,” J. Adv. Comput. Intell. Intell. Inform., Vol.1 No.2, pp. 94-103, 1997.
Data files:

*This site is desgined based on HTML5 and CSS3 for modern browsers, e.g. Chrome, Firefox, Safari, Edge, Opera.

Last updated on Apr. 22, 2024