Abstract
This paper presents an algorithm called IBP that combines case-based and model-based reasoning for an interpretive CBR application, predicting the outcome of legal cases. IBP uses a weak model of the domain to identify the issues raised in a case, and to combine the analyses for these issues; it reasons with cases to resolve conflicting evidence related to each issue. IBP reasons symbolically about the relevance of cases and uses evidential inferences. Experiments with a collection of historic cases show that IBP’s predictions are better than those made with its weak model or with cases alone. IBP also has higher accuracy compared to standard inductive and instance-based learning algorithms.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aha, D. 1991. Case-based learning algorithms. In Proce. DARPA Case-Based Reasoning Workshop, 147–158.
Aleven, V. 1997. Teaching Case-Based Argumentation through a Model and Examples. Ph.D. Dissertation, University of Pittsburgh.
Aleven, V. 2003. Using Background Knowledge in Case-Based Legal Reasoning: A Computational Model and an Intelligent Learning Environment. Artificial Intelligence. Special Issue on Artificial Intelligence and Law. In Press.
Ashley, K. 1990. Modeling Legal Argument, Reasoning with Cases and Hypotheticals. MIT-Press.
Branting, K.; Hastings, J.; and Lockwood, J. 2001. CARMA: A Case-Based Range Management Advisor. In Proc. IAAI-2001, 3–10.
Branting, L. 1999. Reasoning with Rules and Precedents-A Computational Model of Legal Analysis. Kluwer Academic Publishers.
Brüninghaus, S., and Ashley, K. 2001. The Role of Information Extraction for Textual CBR. In Proce. ICCBR-01, 74–89.
Cohen, W. 1996. Learning Trees and Rules with Set-valued Features. In Proc. AAAI-96, 709–716.
Ditterich, T. 1996. Statistical Tests for Comparing Supervised Classification Learning Algorithms. Oregon State University Technical Report.
Golding, A., and Rosenbloom, P. 1996. Improving Accuracy by Combining Rule-Based and Case-Based Reasoning. Artificial Intelligence 87(1–2):215–254.
Koton, P. 1989. Using experience in learning and problem solving. Ph.D. Dissertation, Massachusetts Institute of Technology, Laboratory of Computer Science.
Marling, C.; Sqalli, M.; Rissland, E.; Munoz-Avila, H.; and Aha, D. 2002. Case-Based Reasoning Integrations. AI Magazine 23(1):69–86.
Mitchell, T. 1997. Machine Learning. Mc Graw Hill.
Popple, J. 1993. SHYSTER: A Pragmatic Legal Expert System. Ph.D. Dissertation, Australian National University, Canberra, Australia.
Quinlan, R. 1993. C4.5: Programs for Machine Learning. Morgan Kaufman.
Rissland, E., and Skalak, D. 1989. Combining Case-Based and Rule-Based Reasoning: A Heuristic Approach. In Proc. IJCAI-89, 534–529.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brüninghaus, S., Ashley, K.D. (2003). Combining Case-Based and Model-Based Reasoning for Predicting the Outcome of Legal Cases. In: Ashley, K.D., Bridge, D.G. (eds) Case-Based Reasoning Research and Development. ICCBR 2003. Lecture Notes in Computer Science(), vol 2689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45006-8_8
Download citation
DOI: https://doi.org/10.1007/3-540-45006-8_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40433-0
Online ISBN: 978-3-540-45006-1
eBook Packages: Springer Book Archive