Thomas S. Kuhn's classic book is now available with a new index.

We discuss several aspects of legal arguments, primarily arguments about the meaning of statutes. First, we discuss how the requirements of argument guide the specification and selection of supporting cases and how an existing case base influences argument formation. Second, we present,our evolving taxonomy of patterns of actual legal argument. This taxonomy builds upon our much earlier work on argument moves and also on our more recent analysis of how cases are used to support arguments for the interpretation of legal (...) statutes. Third, we show how the theory of argument used by CABARET, a hybrid case-based/rule-based reasoner, can support many of the argument patterns in our taxonomy. (shrink)

Planning problems arise in law when an individual (or corporation)wants to perform a sequence of actions that raises legal issues. Manylawyers make their living planning transactions, and a system thathelped them to solve these problems would be in demand.The designer of such a system in a common-law domain must addressseveral difficult issues, including the open-textured nature of legal rules,the relationship between legal rules and cases, the adversarial nature ofthe domain, and the role of argument. In addition, the system's design isconstrained (...) by the fact that the intended users are lawyers, and its operation and output must be convenient for lawyers to use.In this article, I describe a system called CHIRON that I have developed to explore solutions to these issues. This system develops simple plans from representations of statutes and cases in the domain of United States personal income tax planning. (shrink)

The BankXX system models the process of perusing and gathering information for argument as a heuristic best-first search for relevant cases, theories, and other domain-specific information. As BankXX searches its heterogeneous and highly interconnected network of domain knowledge, information is incrementally analyzed and amalgamated into a dozen desirable ingredients for argument (called argument pieces), such as citations to cases, applications of legal theories, and references to prototypical factual scenarios. At the conclusion of the search, BankXX outputs the set of argument (...) pieces filled with harvested material relevant to the input problem situation.This research explores the appropriateness of the search paradigm as a framework for harvesting and mining information needed to make legal arguments. In this article, we describe how legal research fits the heuristic search framework and detail how this model is used in BankXX. We describe the BankXX program with emphasis on its representation of legal knowledge and legal argument. We describe the heuristic search mechanism and evaluation functions that drive the program. We give an extended example of the processing of BankXX on the facts of an actual legal case in BankXX's application domain — the good faith question of Chapter 13 personal bankruptcy law. We discuss closely related research on legal knowledge representation and retrieval and the use of search for case retrieval or tasks related to argument creation. Finally we review what we believe are the contributions of this research to the understanding of the diverse disciplines it addresses. (shrink)

In this short note, we discuss several aspectsof dimensions and the related constructof factors. We concentrate on those aspectsthat are relevant to articles in this specialissue, especially those dealing with the analysisof the wild animal cases discussed inBerman and Hafner's 1993 ICAIL article. We reviewthe basic ideas about dimensions,as used in HYPO, and point out differences withfactors, as used in subsequent systemslike CATO. Our goal is to correct certainmisconceptions that have arisen over the years.

Inspired by legal reasoning, this paper presents a formal framework for assessing conflicting arguments. Its use is illustrated with applications to realistic legal examples, and the potential for implementation is discussed. The framework has the form of a logical system for defeasible argumentation. Its language, which is of a logic-programming-like nature, has both weak and explicit negation, and conflicts between arguments are decided with the help of priorities on the rules. An important feature of the system is that these priorities (...) are not fixed, but are themselves defeasibly derived as conclusions within the system. Thus debates on the choice between conflicting arguments can also be modelled.The proof theory of the system is stated in dialectical style, where a proof takes the form of a dialogue between a proponent and an opponent of an argument. An argument is shown to be justified if the proponent can make the opponent run out of moves in whatever way the opponent attacks. Despite this dialectical form, the system reflects a declarative, or relational approach to modelling legal argument. A basic assumption of this paper is that this approach complements two other lines of research in AI and Law, investigations of precedent-based reasoning and the development of procedural, or dialectical models of legal argument. (shrink)

We discuss five kinds of representations of rationales and provide a formal account of how they can alter disputation. The formal model of disputation is derived from recent work in argument. The five kinds of rationales are compilation rationales, which can be represented without assuming domain-knowledge (such as utilities) beyond that normally required for argument. The principal thesis is that such rationales can be analyzed in a framework of argument not too different from what AI already has. The result is (...) a formal understanding of rationales, a partial taxonomy, and a foundation for computer programs that represent and reason with rationales.The five kinds of rationales are as follows: (c)ompression and (s)pecialization, which yield rules, and (d)isputation, which yields a decision. These are modeled as potentially changing the focus of the dispute. Then there are (f)it, a rationale for rules, and (r)esolution, a rationale for decisions. These cannot be modeled as simply; they force disputation to a meta-level, at least temporarily. (shrink)

For any system that uses previous experience to solve problems in new situations, it is necessary to identify the features in the situation that should match features in the previous cases through some process ofsituation analysis. In this paper, we examine this problem in the legal domain, where lawyers know it asissue spotting. In particular, we present an implementation of issue spotting in CHASER, a legal reasoning system that works in the domain of tort law.This approach is a compromise between (...) generality and efficiency, and is applicable to a range of problems and domains besides legal reasoning. In particular, it presents a principled way to use multiple cases for a single problem by exploiting the inherent structure present in many domains. (shrink)

Law and legal reasoning are a natural target for artificial intelligence systems. Like medical diagnosis and other tasks for expert systems, legal analysis is a matter of interpreting data in terms of higher-level concepts. But in law the data are more like those for a system aimed at understanding natural language: they tell a story about human events that may lead to a lawsuit. Statements of the law, too, are written in natural language and legal arguments are often arguments about (...) what that language means or ought to mean.This study is one of the few research efforts in this fertile area. It is unique in developing a computational model for analyzing legal problems in a way that brings these strands of AI research together and makes sense from a jurisprudential perspective as well.Gardner first analyzes several positions in Anglo-American jurisprudence and their relevance for work in artificial intelligence. She identifies aspects of legal reasoning that any truly expert system in law must make a place for and suggests a way of decomposing the process of legal analysis that takes these aspects into account. She compares the resulting framework with those used by other legal analysis programs. A solid exposition of current AI techniques follows in chapters covering the author's system (written in Maclisp) for offer and acceptance problems, taken from law examinations, involved in contract law.Anne von der Lieth Gardner has a law degree and a Ph.D. in computer science, both from Stanford University. An Artificial Intelligence Approach to Legal Reasoning inaugurates the series Artificial Intelligence and the Law: Processes and Models of Legal Reasoning, edited by L. Thorne McCarty and Edwina L. Rissland. A Bradford Book. (shrink)