Argumentation schemes [1–3] are a relatively recent notion that continues an extremely ancient debate on one of the foundations of human reasoning, human comprehension, and obviously human argumentation, i.e., the topics. To understand the revolutionary nature of Walton’s work on this subject matter, it is necessary to place it in the debate that it continues and contributes to, namely a view of logic that is much broader than the formalistic perspective that has been adopted from the 20th century until nowadays. (...) With his book Argumentation schemes for presumptive reasoning, Walton attempted to start a dialogue between three different fields or views on human reasoning – one (argumentation theory) very recent, one (dialectics) very ancient and with a very long tradition, and one (formal logic) relatively recent, but dominating in philosophy. Argumentation schemes were proposed as dialectical instruments, in the sense that they represented arguments not only as formal relations, but also as pragmatic inferences in the sense that they depend on what the interlocutors share and accept in a given dialogical circumstance and affect their dialogical relation. In this introduction, the notion of argumentation scheme will be analyzed in detail, showing its different dimensions and its defining features which make them an extremely useful instrument in Artificial Intelligence. This theoretical background will be followed by a literature review on the uses of the schemes in computing, aimed at identifying the most important areas and trends, the most promising proposals, and the directions of future research. (shrink)

Douglas Walton’s multitudinous contributions to the study of argumentation seldom, if ever, directly engage with argumentation in mathematics. Nonetheless, several of the innovations with which he is most closely associated lend themselves to improving our understanding of mathematical arguments. I concentrate on two such innovations: dialogue types (§1) and argumentation schemes (§2). I argue that both devices are much more applicable to mathematical reasoning than may be commonly supposed.

The article develops and justifies, on the basis of the epistemological argumentation theory, two central pieces of the theory of evaluative argumentation interpretation: 1. criteria for recognizing argument types and 2. rules for adding reasons to create ideal arguments. Ad 1: The criteria for identifying argument types are a selection of essential elements from the definitions of the respective argument types. Ad 2: After presenting the general principles for adding reasons (benevolence, authenticity, immanence, optimization), heuristics are proposed for finding missing (...) reasons, for deductive arguments, e.g., semantic tableaux are suggested. (shrink)

The classification of a state of affairs under a legal category can be considered as a kind of con- densed decision that can be made explicit, analyzed, and assessed us- ing argumentation schemes. In this paper, the controversial conflict of opinions concerning the nature of “marriage” in Obergefell v. Hodges is analyzed pointing out the dialecti- cal strategies used for addressing the interpretive doubts. The dispute about the same-sex couples’ right to marry hides a much deeper disa- greement not only (...) about what mar- riage is, but more importantly about the dialectical rules for defining it. (shrink)

Tribunals have come to depend increasingly on expertise for determining the facts in cases. However, current legal methods have proved problematic to work with. This paper argues that, as a special model of public understanding of science, assessing expertise should consider source credibility of expertise from internal aspects, including scientific validity and reliability, and external aspects involving the credibility of experts. Using the Carneades Argumentation System we show that the internal and the external aspects are mediated by the structure of (...) the argument from expert opinion with its matching set of critical questions. (shrink)

Primeiramente, oferecemos uma apresentação teórica da representação do pensamento prático, começando pela distinção entre silogismo dialético e silogismo demonstrativo. Fazemos referência à crítica de Toulmin contra o dedutivismo dominante de seu tempo. Em seguida, fornecemos argumentos para apoiar a relevância heurística do modelo de Toulmin para entender a discussão sobre a inclusão da lógica padrão na representação do pensamento comum. Afirmamos que o projeto analítico toulmaniano permite entender, com clareza metódica, a derrotabilidade dos argumentos do senso comum por meio da (...) investigação da noção modal de probabilidade na linguagem comum. First, we offer theoretical resemblance of the representation of practical reasoning, beginning with the distinction between demonstrative and dialectical syllogism. We make reference to the Toulmin’s critique against to the dominant deductivism in his time. Then we give arguments to sustain the heuristic relevance of Toulmin’s model to understand the discussion about the inclusion of default logics in the representation of ordinary reasoning. We assert that the Toulminian analytic design allows to understand, with methodical clarity, the defeasibility of common sense arguments by means of the investigation of the modal notion of probability in ordinary language. (shrink)

According to the argument scheme approach, to evaluate a given scheme-saturating instance completely does entail asking all critical questions relevant to it. Although this is a central task for argumentation theorists, the field currently lacks a method for providing a complete argument evaluation. Approaching this task at the meta-level, we combine a logical with a substantive approach to the argument schemes by starting from Toulmin’s schema: ‘data, warrant, so claim’. For the yet more general schema: ‘premise; if premise, then conclusion; (...) so conclusion’, we forward a meta-level CQ-list that is arguably both complete and applicable. This list should inform ongoing theoretical efforts at generating appropriate object-level CQs for specific argument schemes. (shrink)

This paper presents a way in which formal logic can be understood and reformulated in terms of argumentation that can help us unify formal and informal reasoning. Classical deductive reasoning will be expressed entirely in terms of notions and concepts from argumentation so that formal logical entailment is equivalently captured via the arguments that win between those supporting concluding formulae and arguments supporting contradictory formulae. This allows us to go beyond Classical Logic and smoothly connect it with human reasoning, thus (...) providing a uniform argumentation-based view of both informal and formal logic. (shrink)

In this paper, it is argued that the most fruitful approach to developing normative models of argument quality is one that combines the argumentation scheme approach with Bayesian argumentation. Three sample argumentation schemes from the literature are discussed: the argument from sign, the argument from expert opinion, and the appeal to popular opinion. Limitations of the scheme-based treatment of these argument forms are identified and it is shown how a Bayesian perspective may help to overcome these. At the same time, (...) the contributions of the standard scheme-based approach are highlighted, and it is argued that only a combination of the insights of different traditions will yield a complete normative theory of argument quality. (shrink)

David Hitchcock and Bart Verheij (eds): Arguing on the Toulmin Model. New Essays in Argument Analysis and Evaluation Content Type Journal Article Pages 1-13 DOI 10.1007/s10503-011-9214-y Authors Lester C. van der Pluijm, University of Amsterdam, Amsterdam, The Netherlands Jacky C. Visser, University of Amsterdam, Amsterdam, The Netherlands Journal Argumentation Online ISSN 1572-8374 Print ISSN 0920-427X.

In this article the argumentation structure of the court’s decision in the Popov v. Hayashi case is formalised in Prakken’s (Argument Comput 1:93–124; 2010) abstract framework for argument-based inference with structured arguments. In this framework, arguments are inference trees formed by applying two kinds of inference rules, strict and defeasible rules. Arguments can be attacked in three ways: attacking a premise, attacking a conclusion and attacking an inference. To resolve such conflicts, preferences may be used, which leads to three corresponding (...) kinds of defeat, after which Dung’s (Artif Intell 77:321–357; 1995) abstract acceptability semantics can be used to evaluate the arguments. In the present paper the abstract framework is instantiated with strict inference rules corresponding to first-order logic and with defeasible inference rules for defeasible modus ponens and various argument schemes. The main techniques used in the formal reconstruction of the case are rule-exception structures and arguments about rule validity. Arguments about socio-legal values and the use of precedent cases are reduced to arguments about rule validity. The tree structure of arguments, with explicit subargument relations between arguments, is used to capture the dependency relations between the elements of the court’s decision. (shrink)

Trust is a natural mechanism by which an autonomous party, an agent, can deal with the inherent uncertainty regarding the behaviours of other parties and the uncertainty in the information it shares with those parties. Trust is thus crucial in any decentralised system. This paper builds on recent efforts to use argumentation to reason about trust. Specifically, a set of schemes is provided, and abstract patterns of reasoning that apply in multiple situations geared towards trust. Schemes are described in which (...) one agent, A, can establish arguments for trusting another agent, B, directly, as well as schemes that A can use to construct arguments for trusting C, where C is trusted by B. For both sets of schemes, a set of critical questions is offered that identify the situations in which these schemes can fail. (shrink)

The Toulmin model has been proved useful in law and argumentation theory. This model describes the basic process in justifying a claim, which comprises six elements, i.e., claim (C), data (D), warrant (W), backing (B), qualifier (Q), and rebuttal (R). Specifically, in justifying a claim, one must put forward ‘data’ and a ‘warrant’, whereas the latter is authorized by ‘backing’. The force of the ‘claim’ being justified is represented by the ‘qualifier’, and the condition under which the claim cannot be (...) justified is represented as the ‘rebuttal’. To further improve the model, (Goodnight, Informal Logic 15:41–52, 1993) points out that the selection of a backing needs justification, which he calls legitimation justification. However, how such justification is constituted has not yet been clarified. To identify legitimation justification, we separate it into two parts. One justifies a backing’s eligibility (legitimation justification 1 ; LJ 1 ); the other justifies its superiority over other eligible backings (legitimation justification 2 ; LJ 2 ). In this paper, we focus on LJ 1 and apply it to the legal justification (of judgements) in hard cases for illustration purposes. We submit that LJ 1 refers to the justification of the legal interpretation of a norm by its backing, which can be further separated into several orderable subjustifications. Taking the subjustification of a norm’s existence as an example, we show how it would be influenced by different positions in the philosophy of law. Taking the position of the theory of natural law, such subjustification is presented and evaluated. This paper aims not only to inform ongoing theoretical efforts to apply the Toulmin model in the legal field, but it also seeks to clarify the process in the justification of legal judgments in hard cases. It also offers background information for the possible construction of related AI systems. In our future work, LJ 2 and other subjustifications of LJ 1 will be discussed. (shrink)

Dung’s abstract argumentation frameworks have had a very significant role in the rise in interest in argumentation throughout this century. In this paper we will explore the impact of this seminal...

The DAPRECO knowledge base is the main outcome of the interdisciplinary project bearing the same name. It is a repository of rules written in LegalRuleML, an XML formalism designed to be a standard for representing the semantic and logical content of legal documents. The rules represent the provisions of the General Data Protection Regulation, the new Regulation that is significantly affecting the digital market in the European Union and beyond. The DAPRECO knowledge base builds upon the Privacy Ontology, which provides (...) a model for the legal concepts involved in the GDPR, by adding a further layer of constraints in the form of if-then rules, referring either to standard first order logic implications or to deontic statements. If-then rules are formalized in reified Input/Output logic and then codified in LegalRuleML. Reified Input/Output logic is an application of standard Input/Output logic for legal reasoning, in which Input/Output logic is combined with the reification-based approach in Hobbs and Gordon. The DAPRECO knowledge base is then a case study for reified Input/Output logic, and it shows that the formalism indeed appears to be a good candidate to effectively formalize, via uniform and simple representations, complex linguistic/deontic phenomena that may be found in legal texts. To date, the DAPRECO knowledge base is the biggest knowledge base in LegalRuleML and Input/Output logic freely available online. (shrink)

Logic-based approaches to legal problem solving model the rule-governed nature of legal argumentation, justification, and other legal discourse but suffer from two key obstacles: the absence of efficient, scalable techniques for creating authoritative representations of legal texts as logical expressions; and the difficulty of evaluating legal terms and concepts in terms of the language of ordinary discourse. Data-centric techniques can be used to finesse the challenges of formalizing legal rules and matching legal predicates with the language of ordinary parlance by (...) exploiting knowledge latent in legal corpora. However, these techniques typically are opaque and unable to support the rule-governed discourse needed for persuasive argumentation and justification. This paper distinguishes representative legal tasks to which each approach appears to be particularly well suited and proposes a hybrid model that exploits the complementarity of each. (shrink)

There is a tension with regard to regulative norms of inquiry. One’s commitments must survive critical scrutiny, and if they do not survive, they should be revised. Alternately, for views to be adequately articulated and defended, their proponents must maintain a strong commitment to the views in question. A solution is proposed with the notion of holding one’s own as the virtue of being reason-responsive with the prospects of improving the view in question.