Predicting Outcomes of Case-Based Legal Arguments

In this paper, we introduce IBP, an algorithm that combines g with an abstract domain model and case-based reasoning techniques to predict the outcome of case-based legal arguments. Unlike the predictions generated by statistical or machine-learning techniques, IBP’s predictions are accompanied by explanations. We describe an empirical evaluation of IBP, in which we compare our algorithm to prediction based on Hypo’s and CATO’s relevance criteria, and to a number of widely used machine learning algorithms. IBP reaches higher accuracy than all competitors, and hypothesis testing shows that the observed differences are statistically significant. An ablation study indicates that both sources of knowledge in IBP contribute to the accuracy of its predictions.

• Type: Conference
• Year: 2003
• Where: ICAIL
• Authors: Stefanie Brüninghaus, Kevin D. Ashley
• Keywords: Case-based Reasoning Techniques, IBP’s Predictions, ICAIL 2003, Knowledge In Ibp