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)

A central theme throughout the impressive series of philosophical books and articles Stephen Toulmin has published since 1948 is the way in which assertions and opinions concerning all sorts of topics, brought up in everyday life or in academic research, can be rationally justified. Is there one universal system of norms, by which all sorts of arguments in all sorts of fields must be judged, or must each sort of argument be judged according to its own norms? In The Uses (...) of Argument Toulmin sets out his views on these questions for the first time. In spite of initial criticisms from logicians and fellow philosophers, The Uses of Argument has been an enduring source of inspiration and discussion to students of argumentation from all kinds of disciplinary background for more than forty years. (shrink)

Develops a logical analysis of dialogue in which two or more parties attempt to advance their own interests. It includes a classification of the major types of dialogues and a discussion of several important informal fallacies.

In this work it is argued that legal justification can best be studied from a procedural, dialogical point of view: legal statements are justified if the audience is convinced in an argumentative dialog. The formalized and implemented model DiaLaw guards the procedure in which two players aim at justifying statements. DiaLaw shows the advances and problems linked to procedural models of legal justification. Moreover, an instructive discussion of the different models of procedural justification is provided. It is stressed that in (...) legal justification not only logically compelling arguments should be considered, but also convincing arguments. Therefore DiaLaw also deals with the rhetorical, psychological aspects of argument. This book is relevant for scholars in legal theory, artificial intelligence, and argumentation, and can be used in graduate courses on AI and Law, and legal argumentation. (shrink)

Computational dialectics is concerned with the formal representation of argument and dispute. The field emerged from developments in philosophy, artificial intelligence and legal theory. Its goal is to suggestalgorithms, procedures and protocols to investigate the tenability of logical claims, on the basis of information in the form of rules and cases. Currently, the field slowlyconverges to the opinion that dispute is the most fair and effective way to investigate claims. The basic assumption of this field is that dispute is the (...) most fair and effective way to investigate claims. The definition of a formal dispute varies throughout the literature, butis considered not to vary within one and the same logical system. In this paper it is shown that parts of the definition of a dispute may change within one logical system.To this end, the notion of partial protocol specification (PPS) is introduced. A PPS is a part of the definition of the protocol. A modification to the protocol, in the form of a PPS, can be put forward, disputed, established and incorporated as aneffective `point of order. The paper demonstrates the existence of self-undermining PPSs, it discusses the relevance of PPSs for dialectical models of legal argument and concludes with a description of how PPSs can be built into existing argumentation systems. (shrink)

Dialogues and dialectics have come to playan important role in the field of ArtificialIntelligence and Law. This paper describes thelegal-theoretical and logical background of this role,and discusses the different services into whichdialogues are put. These services include:characterising logical operators, modelling thedefeasibility of legal reasoning, providing the basisfor legal justification and identifying legal issues,and establishing the law in concrete cases. Specialattention is given to the requirements oflaw-establishing dialogues.

Much work on legal knowledge systems treats legal reasoning as arguments that lead from a description of the law and the facts of a case, to the legal conclusion for the case. The reasoning steps of the inference engine parallel the logical steps by means of which the legal conclusion is derived from the factual and legal premises. In short, the relation between the input and the output of a legal inference engine is a logical one. The truth of the (...) conclusion only depends on the premises, and is independent of the argument that leads to the conclusion.This paper opposes the logical approach, and defends a procedural approach to legal reasoning. Legal conclusions are not true or false independent of the reasoning process that ended in these conclusions. In critical cases this reasoning process consists of an adversarial procedure in which several parties are involved. The course of the argument determines whether the conclusion is true or false. The phenomenon of hard cases is used to demonstrate this essential procedural nature of legal reasoning. (shrink)

ABSTRACT Inspired by legal reasoning, this paper presents a semantics and proof theory of a system for defeasible argumentation. Arguments are expressed in a logic-programming language with both weak and strong negation, 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 (...) semantics of the system is given with a fixpoint definition, while its proof theory 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. (shrink)

Rule-applying legal arguments are traditionally treated as a kind of syllogism. Such a treatment overlooks the fact that legal principles and rules are not statements which describe the world, but rather means by which humans impose structure on the world. Legal rules create legal consequences, they do not describe them. This has consequences for the logic of rule- and principle-applying arguments, the most important of which may be that such arguments are defeasible. This book offers an extensive analysis of the (...) role of rules and principles in legal reasoning, which focuses on the close relationship between rules, principles, and reasons. Moreover, it describes a logical theory which assigns a central place to the notion of reasons for and against a conclusion, and which is especially suited to deal with rules and principles. (shrink)

tational background of dialectic: the structure of formal disputation. Formal disputation Perhaps the clearest, and surely historically the most prominent, ...

The main stream of legal theory tends to incorporate unwritten principles into the law. Weighing of principles plays a great role in legal argumentation, inter alia in statutory interpretation. A weighing and balancing of principles and other prima facie reasons is a jump. The inference is not conclusive.To deal with defeasibility and weighing, a jurist needs both the belief-revision logic and the nonmonotonic logic. The systems of nonmonotonic logic included in the present volume provide logical tools enabling one to speak (...) precisely about various kinds of rules about rules, dealing with such things as applicability of rules, what is assumed by rules, priority between rules and the burden of proof. Nonmonotonic logic is an example of an extension of the domain of logic. But the more far-reaching the extension is, the greater problems it meets. It seems impossible to make logical reconstruction of the totality of legal argumentation. (shrink)

In this paper we describe a method for the specification of computationalmodels of argument using dialogue games. The method, which consists ofsupplying a set of semantic definitions for the performatives making upthe game, together with a state transition diagram, is described in full.Its use is illustrated by some examples of varying complexity, includingtwo complete specifications of particular dialogue games, Mackenzie's DC,and the authors' own TDG. The latter is also illustrated by a fully workedexample illustrating all the features of the game.