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)

The Pleadings Game is a normative formalization and computational model of civil pleading, founded in Roberty Alexy''s discourse theory of legal argumentation. The consequences of arguments and counterarguments are modelled using Geffner and Pearl''s nonmonotonic logic,conditional entailment. Discourse in focussed using the concepts of issue and relevance. Conflicts between arguments can be resolved by arguing about the validity and priority of rules, at any level. The computational model is fully implemented and has been tested using examples from Article Nine of (...) the Uniform Commercial Code. (shrink)

The Pleadings Game is a major contribution to artificial intelligence and legal theory. The book draws on jurisprudence and moral philosophy to develop a formal model of argumentation called the pleadings game. From a technical perspective, the work can be viewed as an extension of recent argumentation-based approaches to non-monotonic logic: (1) the game is dialogical rather than mono-logical; (2) the validity and priority of defeasible rules is subject to debate; and (3) resource limitations are acknowledged by rules for fairly (...) dividing the burdens of representation and proof among the players. Gordon's work evaluates important jurisprudential theories of argumentation and reasoning in the context of the U.S. commercial law on secured transactions. Audience: It is not necessary to have a formal background in law to appreciate The Pleadings Game. It will be of equal interest to both the artificial intelligence community and legal theorists. (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)

Six experiments explored the hypothesis that the members of categories which are considered most prototypical are those with most attributes in common with other members of the category and least attributes in common with other categories. In probabilistic terms, the hypothesis is that prototypicality is a function of the total cue validity of the attributes of items. In Experiments 1 and 3, subjects listed attributes for members of semantic categories which had been previously rated for degree of prototypicality. High positive (...) correlations were obtained between those ratings and the extent of distribution of an item's attributes among the other items of the category. In Experiments 2 and 4, subjects listed superordinates of category members and listed attributes of members of contrasting categories. Negative correlations were obtained between prototypicality and superordinates other than the category in question and between prototypicality and an item's possession of attributes possessed by members of contrasting categories. Experiments 5 and 6 used artificial categories and showed that family resemblance within categories and lack of overlap of elements with contrasting categories were correlated with ease of learning, reaction time in identifying an item after learning, and rating of prototypicality of an item. It is argued that family resemblance offers an alternative to criterial features in defining categories. (shrink)