Using genetic algorithms to inductively reason with cases in the legal domain

Reasoning pragmatically (rather than using theories of jurisprudence) from cases has been established as a viable model of legal reasoning. Cases are recognized as encapsulating specific knowledge tied to a context. The reasoning done with cases lead to solutions that are tied to situations. To generalize these solutions, the use of machine learning techniques is often necessary. Induction from cases, seen as ‘examples’ with a ‘classification’ in a domain, is one of these techniques. A Genetic Algorithm based approach to inductively learn features of a case in a legal casebase that leads to specified classifications is described in this paper. This knowledge can then be used to reason about cases that are ‘interesting’ by virtue of their features and classification, and to predict classifications of other cases. This method is contrasted with other well known techniques in machine learning. The claim is made that prototgpe exemplars can be generated efficiently and that operational information from any domain (ie. cases) can be used to guide the generation, using variants of this technique.

[1]  James Popple,et al.  SHYSTER: A Pragmatic Legal Expert System , 1993 .

[2]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[3]  Barr and Feigenbaum Edward A. Avron The Handbook of Artificial Intelligence , 1981 .

[4]  H. Penny Nii,et al.  The Handbook of Artificial Intelligence , 1982 .

[5]  Thomas G. Dietterich,et al.  Readings in Machine Learning , 1991 .

[6]  Richard J. Enbody,et al.  Further Research on Feature Selection and Classification Using Genetic Algorithms , 1993, ICGA.

[7]  Paul R. Cohen,et al.  Handbook of AI , 1986 .

[8]  David W. Aha,et al.  Learning Representative Exemplars of Concepts: An Initial Case Study , 1987 .

[9]  Kevin D. Ashley,et al.  Waiting on Weighting: A Symbolic Least Commitment Approach , 1988, AAAI.

[10]  Kevin D. Ashley Modeling legal argument - reasoning with cases and hypotheticals , 1991, Artificial intelligence and legal reasoning.

[11]  Paul Thagard,et al.  Induction: Processes Of Inference , 1989 .

[12]  Avron Barr,et al.  The Handbook of Artificial Intelligence , 1982 .

[13]  Sushil J. Louis,et al.  Case-based reasoning assisted explanation of genetic algorithm results , 1993, J. Exp. Theor. Artif. Intell..

[14]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[15]  Vincent Aleven,et al.  Automated Generation of Examples for a Tutorial in Case-Based Argumentation , 1992, Intelligent Tutoring Systems.

[16]  Kenneth A. De Jong,et al.  Learning Concept Classification Rules Using Genetic Algorithms , 1991, IJCAI.

[17]  John H. Holland,et al.  Induction: Processes of Inference, Learning, and Discovery , 1987, IEEE Expert.

[18]  Lawrence Davis,et al.  Hybridizing the Genetic Algorithm and the K Nearest Neighbors Classification Algorithm , 1991, ICGA.