This is an introductory guidebook to the basic principles of how to construct good arguments and how to criticeze bad ones. It is non-technical in its approach and is based on 150 key examples, each discussed and evaluated in clear, illustrative detail. Professor Walton, a leading authority in the field of informal logic, explains how errors, fallacies, and other key failures of argument occur. He shows how correct uses of argument are based on sound strategies for reasoned persuasion and critical (...) responses. Among the many subjects covered are: forms of valid argument, relevance, appeals to emotion, personal attack, uses and abuses of expert opinion, problems in deploying statistics, loading terms, equivocation, arguments from analogy, and techniques of posing, replying to, and criticizing questions. The book will be ideally suited to courses in informal logic and in the introduction to philosophy. It will also prove valuable to studetns of pragmatics, rhetoric, and speech communication. (shrink)

Since it was first proposed by Moses, Shoham, and Tennenholtz, the social laws paradigm has proved to be one of the most compelling approaches to the offline coordination of multiagent systems. In this paper, we make four key contributions to the theory and practice of social laws in multiagent systems. First, we show that the Alternating-time Temporal Logic (atl) of Alur, Henzinger, and Kupferman provides an elegant and powerful framework within which to express and understand social laws for multiagent systems. (...) Second, we show that the effectiveness, feasibility, and synthesis problems for social laws may naturally be framed as atl model checking problems, and that as a consequence, existing atl model checkers may be applied to these problems. Third, we show that the complexity of the feasibility problem in our framework is no more complex in the general case than that of the corresponding problem in the Shoham–Tennenholtz framework (it is np-complete). Finally, we show how our basic framework can easily be extended to permit social laws in which constraints on the legality or otherwise of some action may be explicitly required. We illustrate the concepts and techniques developed by means of a running example. (shrink)

This paper studies the modelling of legal reasoning about evidence within general theories of defeasible reasoning and argumentation. In particular, Wigmore's method for charting evidence and its use by modern legal evidence scholars is studied in order to give a formal underpinning in terms of logics for defeasible argumentation. Two notions turn out to be crucial, viz. argumentation schemes and empirical generalisations.

We describe PADUA, a protocol designed to support two agents debating a classification by offering arguments based on association rules mined from individual datasets. We motivate the style of argumentation supported by PADUA, and describe the protocol. We discuss the strategies and tactics that can be employed by agents participating in a PADUA dialogue. PADUA is applied to a typical problem in the classification of routine claims for a hypothetical welfare benefit. We particularly address the problems that arise from the (...) extensive number of misclassified examples typically found in such domains, where the high error rate is a widely recognised problem. We give examples of the use of PADUA in this domain, and explore in particular the effect of intermediate predicates. We have also done a large scale evaluation designed to test the effectiveness of using PADUA to detect misclassified examples, and to provide a comparison with other classification systems. (shrink)

Argument invention is a method that can be used to help an arguer find arguments that could be used to prove a claim he needs to defend. The aim of this paper is to show how argumentation systems recently developed in artificial intelligence can be applied to the task of argument invention. One such system called Carneades is featured. Carneades can be used to analyze arguments, evaluate arguments, to make an argument diagram, and to construct arguments from a database. Using (...) some simple examples, the paper explains how Carneades works as a system of argument invention. (shrink)

Argument invention is a method that can be used to help an arguer find arguments that could be used to prove a claim he needs to defend. The aim of this paper is to show how argumentation systems recently developed in artificial intelligence can be applied to the task of argument invention. One such system called Carneades is featured. Carneades can be used to analyze arguments, evaluate arguments, to make an argument diagram, and to construct arguments from a database. Using (...) some simple examples, the paper explains how Carneades works as a system of argument invention. (shrink)

This chapter proposes a dialectical approach to legal interpretation, consisting of three dimensions: a formalization of the canons of interpretation in terms of argumentation schemes; a dialectical classification of interpretive schemes; and a logical and computational model for comparing the arguments pro and contra an interpretation. The traditional interpretive maxims or canons used in both common and civil law are translated into defeasible patterns of arguments, which can be evaluated through sets of corresponding critical questions. These interpretive argumentation schemes are (...) classified in general categories and a distinction is drawn between schemes supporting and rebutting an interpretation. This framework allows conceiving statutory interpretation as a dialectical procedure consisting in weighing arguments pro and contra an interpretation. This procedure is formalized and represented computationally through tools from formal argumentation systems. (shrink)

This paper compares the features and methods of the two leading implemented systems that offer a tool for helping a user to find or invent arguments to support or attack a designated conclusion, the Carneades Argumentation System and the IBM Watson Debater tool. The central aim is to contribute to the understanding of scholars in informal logic, rhetoric and argumentation on how these two software systems can be useful for them. One contribution of the paper is to explain to these (...) potential users how the two tools are applicable to the task of inventing arguments by using some simple illustrative examples. Another is to redefine the structure of argument invention as a procedure. (shrink)

This paper presents a formalization of informal logic using the Carneades Argumentation System, a formal, computational model of argument that consists of a formal model of argument graphs and audiences. Conflicts between pro and con arguments are resolved using proof standards, such as preponderance of the evidence. CAS also formalizes argumentation schemes. Schemes can be used to check whether a given argument instantiates the types of argument deemed normatively appropriate for the type of dialogue.

Plausible (eikotic) reasoning known from ancient Greek (late Academic) skeptical philosophy is shown to be a clear notion that can be analyzed by argumentation methods, and that is important for argumentation studies. It is shown how there is a continuous thread running from the Sophists to the skeptical philosopher Carneades, through remarks of Locke and Bentham on the subject, to recent research in artificial intelligence. Eleven characteristics of plausible reasoning are specified by analyzing key examples of it recognized as important (...) in ancient Greek skeptical philosophy using an artificial intelligence model called the Carneades Argumentation System (CAS). By applying CAS to ancient examples it is shown how plausible reasoning is especially useful for gaining a better understanding of evidential reasoning in law, and argued that it can also be applied to everyday argumentation. Our analysis of the snake and rope example of Carneades is also used to point out some ways CAS needs to be extended if it is to more fully model the views of this ancient philosopher on argumentation. (shrink)

This paper offers a new model of belief by embedding the Peircean account of belief into a formal dialogue system that uses argumentation schemes for practical reasoning and abductive reasoning. A belief is characterised as a stable proposition that is derived abductively by one agent in a dialogue from the commitment set (including commitments derived from actions and goals) of another agent. On the model (to give a rough summary), a belief is defined as a proposition held by an agent (...) that (1) is not easily changed (stable), (2) is a matter of degree (held more or less weakly or strongly), (3) guides the goals and actions of the agent, and (4) is habitually or tenaciously held in a manner that indicates a strong commitment to defend it. It is argued that the new model overcomes the pervasive conflict in artificial intelligence between the belief-desire-intention model of reasoning and the commitment model. (shrink)

This paper proposes an argumentation-based procedure for legal interpretation, by reinterpreting the traditional canons of textual interpretation in terms of argumentation schemes, which are then classified, formalized, and represented through argument visualization and evaluation tools. The problem of statutory interpretation is framed as one of weighing contested interpretations as pro and con arguments. The paper builds an interpretation procedure by formulating a set of argumentation schemes that can be used to comparatively evaluate the types of arguments used in cases of (...) contested statutory interpretation in law. A simplified version of the Carneades Argumentation System is applied in a case analysis showing how the procedure works. A logical model for statutory interpretation is finally presented, covering pro-tanto and all-things-considered interpretive conclusions. (shrink)

This paper describes an approach to legal logic based on the formal analysis of argumentation schemes. Argumentation schemes a notion borrowed from the .eld of argumentation theory - are a kind of generalized rules of inference, in the sense that they express that given certain premises a particular conclusion can be drawn. However, argumentation schemes need not concern strict, abstract, necessarily valid patterns of reasoning, but can be defeasible, concrete and contingently valid, i.e., valid in certain contexts or under certain (...) circumstances. A method is presented to analyze argumentation schemes and it is shown how argumentation schemes can be embedded in a formal model of dialectical argumentation. (shrink)

Since it was first proposed by Moses, Shoham, and Tennenholtz, the social laws paradigm has proved to be one of the most compelling approaches to the offline coordination of multiagent systems. In this paper, we make four key contributions to the theory and practice of social laws in multiagent systems. First, we show that the Alternating-time Temporal Logic (atl) of Alur, Henzinger, and Kupferman provides an elegant and powerful framework within which to express and understand social laws for multiagent systems. (...) Second, we show that the effectiveness, feasibility, and synthesis problems for social laws may naturally be framed as atl model checking problems, and that as a consequence, existing atl model checkers may be applied to these problems. Third, we show that the complexity of the feasibility problem in our framework is no more complex in the general case than that of the corresponding problem in the Shoham–Tennenholtz framework (it is np-complete). Finally, we show how our basic framework can easily be extended to permit social laws in which constraints on the legality or otherwise of some action may be explicitly required. We illustrate the concepts and techniques developed by means of a running example. (shrink)

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)

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)

This article presents a formal dialogue game for adjudication dialogues. Existing AI & law models of legal dialogues and argumentation-theoretic models of persuasion are extended with a neutral third party, to give a more realistic account of the adjudicator’s role in legal procedures. The main feature of the model is a division into an argumentation phase, where the adversaries plea their case and the adjudicator has a largely mediating role, and a decision phase, where the adjudicator decides the dispute on (...) the basis of the claims, arguments and evidence put forward in the argumentation phase. The model allows for explicit decisions on admissibility of evidence and burden of proof by the adjudicator in the argumentation phase. Adjudication is modelled as putting forward arguments, in particular undercutting and priority arguments, in the decision phase. The model reconciles logical aspects of burden of proof induced by the defeasible nature of arguments with dialogical aspects of burden of proof as something that can be allocated by explicit decisions on legal grounds. (shrink)

An abstract framework for structured arguments is presented, which instantiates Dung's ('On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming, and n- Person Games', Artificial Intelligence , 77, 321-357) abstract argumentation frameworks. Arguments are defined as inference trees formed by applying two kinds of inference rules: strict and defeasible rules. This naturally leads to three ways of attacking an argument: attacking a premise, attacking a conclusion and attacking an inference. To resolve such attacks, preferences may (...) be used, which leads to three corresponding kinds of defeat: undermining, rebutting and undercutting defeats. The nature of the inference rules, the structure of the logical language on which they operate and the origin of the preferences are, apart from some basic assumptions, left unspecified. The resulting framework integrates work of Pollock, Vreeswijk and others on the structure of arguments and the nature of defeat and extends it in several respects. Various rationality postulates are proved to be satisfied by the framework, and several existing approaches are proved to be a special case of the framework, including assumption-based argumentation and DefLog. (shrink)

There was a long tradition in philosophy according to which good reasoning had to be deductively valid. However, that tradition began to be questioned in the 1960’s, and is now thoroughly discredited. What caused its downfall was the recognition that many familiar kinds of reasoning are not deductively valid, but clearly confer justification on their conclusions. Here are some simple examples.

The fields of linguistic pragmatics and legal interpretation are deeply interrelated. The purpose of this paper is to show how pragmatics and the developments in argumentation theory can contribute to the debate on legal interpretation. The relation between the pragmatic maxims and the presumptions underlying the legal canons are brought to light, unveiling the principles that underlie the types of argument usually used to justify a construction. The Gricean maxims and the arguments of legal interpretation are regarded as presumptions subject (...) to default used to justify an interpretation. This approach can allow one to trace the different legal interpretive arguments back to their basic underlying presumptions, so that they can be compared, ordered, and assessed according to their defeasibility conditions. This approach allows one to understand the difference between various types of interpretive canons, and their strength in justifying an interpretation. (shrink)

This paper proposes an argumentation-based procedure for legal interpretation, by reinterpreting the traditional canons of textual interpretation in terms of argumentation schemes, which are then classified, formalized, and represented through argument visualization and evaluation tools. The problem of statutory interpretation is framed as one of weighing contested interpretations as pro and con arguments. The paper builds an interpretation procedure by formulating a set of argumentation schemes that can be used to comparatively evaluate the types of arguments used in cases of (...) contested statutory interpretation in law. A simplified version of the Carneades Argumentation System is applied in a case analysis showing how the procedure works. A logical model for statutory interpretation is finally presented, covering pro-tanto and all-things-considered interpretive conclusions. -/- . (shrink)

This paper explains how to use a new software tool for argument diagramming available free on the Internet, showing especially how it can be used in the classroom to enhance critical thinking in philosophy. The user loads a text file containing an argument into a box on the computer interface, and then creates an argument diagram by dragging lines from one node to another. A key feature is the support for argumentation schemes, common patterns of defeasible reasoning historically know as (...) topics . Several examples are presented, as well as the results of an experiment in using the system with students in a university classroom. (shrink)

It can be said that the roots of the studies on the argumentation theory go back to rhetorical and dialectical studies. One of the sub-fields of the argumentation theory is argument schemes, used in everyday language and various fields within certain rules. Today, with the studies in the field of informal logic, argumentation schemes have aslo become an important field to study. The argumentation schemes approach also plays an important role in the study of artificial language at the intersection of (...) the computer science area. In this article, we discussed Douglas Walton’s argumentation schemes approach. Douglas Walton's aim is to determine the natural language arguments used in various fields and make as a list of them and propose a classification for argumentation schemes. Douglas Walton, presents a model for the argumentation schemes. This model also emphasized the structure suitable for use in computer systems. Determination, analysis and evaluation of arguments are important topics for the arguments applying to computer systems. In this article, we discuss one of these systems, Thomas Gordon’s project, the Carneades Argumentation System. The Carneades Argumentation System is a system which can handle Douglas Walton's argumentation schemes. With the Carneades Argumentation System, it is possible to visualize arguments as an argument map. The visualization of an argumentation provides a concrete basis for philosophical discussions. It makes it easy for the user to determine the scheme of the current argument when applying the argument formats to mapping and evaluation systems such as Carneades Argumentation Systems. Determining the argument scheme allows the argument to be handled within a particular model. The aim of this article is to discuss the argumentation schemes which is one of the topics of study at the intersection of philosophical logic and computer sciences in which informal logic studies are developing today. (shrink)

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)

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)

We present a formal, mathematical model of argument structure and evaluation, taking seriously the procedural and dialogical aspects of argumentation. The model applies proof standards to determine the acceptability of statements on an issue-by-issue basis. The model uses different types of premises (ordinary premises, assumptions and exceptions) and information about the dialectical status of statements (stated, questioned, accepted or rejected) to allow the burden of proof to be allocated to the proponent or the respondent, as appropriate, for each premise separately. (...) Our approach allows the burden of proof for a premise to be assigned to a different party than the one who has the burden of proving the conclusion of the argument, and also to change the burden of proof or applicable proof standard as the dialogue progresses from stage to stage. Useful for modeling legal dialogues, the burden of production and burden of persuasion can be handled separately, with a different responsible party and applicable proof standard for each. Carneades enables critical questions of argumentation schemes to be modeled as additional premises, using premise types to capture the varying effect on the burden of proof of different kinds of questions. (shrink)

We present a high-level declarative programming language for representing argumentation schemes, where schemes represented in this language can be easily validated by domain experts, including developers of argumentation schemes in informal logic and philosophy, and serve as executable specifications for automatically constructing arguments, when applied to a set of assumptions. This new rule language for representing argumentation schemes is validated by using it to represent twenty representative argumentation schemes.

Carneades is an open source argument mapping application and a programming library for building argumentation support tools. In this paper, Carneades’ support for argument reconstruction, evaluation and visualization is illustrated by modeling most of the factual and legal arguments in Popov v Hayashi.

This handbook offers a deep analysis of the main forms of legal reasoning and argumentation from both a logical-philosophical and legal perspective. These forms are covered in an exhaustive and critical fashion, and the handbook accordingly divides in three parts: the first one introduces and discusses the basic concepts of practical reasoning. The second one discusses the main general forms of reasoning and argumentation relevant for legal discourse. The third one looks at their application in law as well as at (...) the different areas of legal reasoning. The handbook’s division in three parts reflects its conceptual architecture, since legal reasoning and argumentation are considered in relation to the more general types of reasoning. (shrink)

Through the use of such "folk" concepts as belief, desire, intention, and expectation, Daniel Dennett asserts in this first full scale presentation of...

In this paper, we look at reasoning with evidence and facts in criminal cases. We show how this reasoning may be analysed in a dialectical way by means of critical questions that point to typical sources of doubt. We discuss critical questions about the evidential arguments adduced, about the narrative accounts of the facts considered, and about the way in which the arguments and narratives are connected in an analysis. Our treatment shows how two different types of knowledge, represented as (...) schemes, play a role in reasoning with evidence: argumentation schemes and story schemes. (shrink)

This paper studies the modelling of legal reasoning about evidence within general theories of defeasible reasoning and argumentation. In particular, Wigmore's method for charting evidence and its use by modern legal evidence scholars is studied in order to give a formal underpinning in terms of logics for defeasible argumentation. Two notions turn out to be crucial, viz. argumentation schemes and empirical generalisations.

Modelling reasoning with legal cases has been a central concern of AI and Law since the 1980s. The approach which represents cases as factors and dimensions has been a central part of that work. In this paper I consider how several varieties of the approach can be applied to the interesting case of Popov v Hayashi. After briefly reviewing some of the key landmarks of the approach, the case is represented in terms of factors and dimensions, and further explored using (...) theory construction and argumentation schemes approaches. (shrink)