| |
| | [No title] |
 | | In legal CBR models, a set of domain-dependent, legally-relevant features is defined, and a prior case is considered more or less on point depending on the degree of match between the features of the prior case and those of the new case. |
 | | Computational models of legal CBR are concerned with the following problems: representation of cases, including their facts, issues, holdings (the judicial conclusions they contain), and results; organization of the case database, including the indexing structure and retrieval algorithms; ranking of retrieved cases by their similarity to a new case; and creation of case-based legal arguments. |
 | | In Toulmin’s theory, an argument’s conclusion is called the claim; the grounds are the facts asserted to support the claim; the warrant is a bridge-like statement (e.g., a legal rule) that provides the logical connection between the grounds and the claim; and the backing is the authority for the warrant (e.g., a statute or regulation). |
| www.ccs.neu.edu /home/hafner/hafner-legal.doc (2019 words) |
|