Most formalisms for representing common-sense knowledge allow incomplete and potentially inconsistent information. When strong negation is also allowed, contradictory conclusions can arise. A criterion for deciding between them is needed. The aim of this paper is to investigate an inherent and autonomous comparison criterion, based on specificity as defined in [POO 85, SIM 92]. In contrast to other approaches, we consider not only defeasible, but also strict knowledge. Our criterion is context-sensitive, i. e., preference among defeasible rules is determined dynamically (...) during the dialectical analysis.We show how specificity can be defined in terms of two different approaches: activation sets and derivation trees. This allows us to get a syntactic criterion that can be implemented in a computationally attractive way. The resulting definitions may be applied in general rulebased formalisms. We present theorems linking both characterizations. Finally we discuss other frameworks for defeasible reasoning in which preference handling is considered explicitly. (shrink)

In this paper we show that any reasoning process in which conclusions can be both fallible and corrigible can be formalized in terms of two approaches: (i) syntactically, with the use of defeasible reasoning, according to which reasoning consists in the construction and assessment of arguments for and against a given claim, and (ii) semantically, with the use of partial structures, which allow for the representation of less than conclusive information. We are particularly interested in the formalization of scientific reasoning, (...) along the lines traced by Lakatos’ methodology of scientific research programs. We show how current debates in cosmology could be put into this framework, shedding light on a very controversial topic. (shrink)

In this article a dialectical model for practical reasoning within a community, based on the Generic/Actual Argument Model (GAAM) is advanced and its application to deliberative dialogue discussed. The GAAM, offers a dynamic template for structuring knowledge within a domain of discourse that is connected to and regulated by a community. The paper demonstrates how the community accepted generic argument structure acts to normatively influence both admissible reasoning and the progression of dialectical reasoning between participants. It is further demonstrated that (...) these types of deliberation dialogues supported by the GAAM comply with criteria for normative principles for deliberation, specifically, Alexy’s rules for discourse ethics and Hitchcock’s Principles of Rational Mutual Inquiry. The connection of reasoning to the community in a documented and transparent structure assists in providing best justified reasons, principles of deliberation and ethical discourse which are important advantages for reasoning communities. (shrink)

Éste es un artículo de lógica informal dedicado a la estructura de los argumentos. En él se mantiene que la estructura de los argumentos está formada por tres tipos de relaciones argumentativas: relaciones entre enunciados, relaciones entre argumentos y enunciados y relaciones enltre argumentos. Los dos últimos tipos de relaciones han recibido menos atención que el primero pero, según se explica en el artículo, son necesarios para dar cuenta de los argumentos hipotéticos o suposicionales y de formas complejas de argumentación (...) como la argumentación coordinada o la argumentación múltiple. (shrink)

Different approaches analyze the strength of a natural language argument in different ways. This paper contrasts the dialectical, structural, probabilistic (or Bayesian), computational, and empirical approaches by exemplarily applying them to a single argumentative text (Epicureans on Squandering Life; Aikin & Talisse, 2019). Rather than pitching these approaches against one another, our main goal is to show the room for fruitful interaction. Our focus is on a dialectical analysis of the squandering argument as an argumentative response that voids an interlocutor’s (...) right to assertion. This analysis addresses the pragmatic dimensions of arguing and implies an argument structure that is consistent with empirical evidence of perceived argument strength. Results show that the squandering argument can be evaluated as a (non-fallacious) ad hominem argument, which however is not necessarily stronger than possible arguments attacking it. (shrink)

Information technology is so ubiquitous and AI’s progress so inspiring that also legal professionals experience its benefits and have high expectations. At the same time, the powers of AI have been rising so strongly that it is no longer obvious that AI applications (whether in the law or elsewhere) help promoting a good society; in fact they are sometimes harmful. Hence many argue that safeguards are needed for AI to be trustworthy, social, responsible, humane, ethical. In short: AI should be (...) good for us. But how to establish proper safeguards for AI? One strong answer readily available is: consider the problems and solutions studied in AI & Law. AI & Law has worked on the design of social, explainable, responsible AI aligned with human values for decades already, AI & Law addresses the hardest problems across the breadth of AI (in reasoning, knowledge, learning and language), and AI & Law inspires new solutions (argumentation, schemes and norms, rules and cases, interpretation). It is argued that the study of AI as Law supports the development of an AI that is good for us, making AI & Law more relevant than ever. (shrink)

The primary aim of this chapter is to explain the nature of evidential reasoning, the characteristic difficulties encountered, and the tools to address these difficulties. Our focus is on evidential reasoning in criminal cases. There is an extensive scholarly literature on these topics, and it is a secondary aim of the chapter to provide readers the means to find their way in historical and ongoing debates.

Dung’s abstract argumentation provides us with a general framework to deal with argumentation, non-monotonic reasoning and logic programming. For the extension-based semantics, one of the basic principles is I-maximality which is in particular related with the notion of skeptical justification. Another one is directionality which can be employed for the study of dynamics of argumentation. In this paper, we introduce two new extension-based semantics into Dung’s abstract argumentation, called grounded-like semantics and initial semantics which satisfy the I-maximality and directionality principles. (...) The initial semantics has many good properties and can be expected to play a central role in studying other extension-based semantics, such as admissible, complete and preferred semantics. (shrink)

This paper presents a theory of reasoning with evidence in order to determine the facts in a criminal case. The focus is on the process of proof, in which the facts of the case are determined, rather than on related legal issues, such as the admissibility of evidence. In the literature, two approaches to reasoning with evidence can be distinguished, one argument-based and one story-based. In an argument-based approach to reasoning with evidence, the reasons for and against the occurrence of (...) an event, e.g., based on witness testimony, are central. In a story-based approach, evidence is evaluated and interpreted from the perspective of the factual stories as they may have occurred in a case, e.g., as they are defended by the prosecution. In this paper, we argue that both arguments and narratives are relevant and useful in the reasoning with and interpretation of evidence. Therefore, a hybrid approach is proposed and formally developed, doing justice to both the argument-based and the narrative-based perspective. By the formalization of the theory and the associated graphical representations, our proposal is the basis for the design of software developed as a tool to make sense of the evidence in complex cases. (shrink)

This paper gives an explication of our intuitive notion of strength of justification in a controversial debate. It defines a thesis' degree of justification within the bipolar argumentation framework of the theory of dialectical structures as the ratio of coherently adoptable positions according to which that thesis is true over all coherently adoptable positions. Broadening this definition, the notion of conditional degree of justification, i.e.\ degree of partial entailment, is introduced. Thus defined degrees of justification correspond to our pre-theoretic intuitions (...) in the sense that supporting and defending a thesis t increases, whereas attacking it decreases, t's degree of justification. Moreover, it is shown that (conditional) degrees of justification are (conditional) probabilities. Eventually, the paper explains that it is rational to believe theses with a high degree of justification insofar as this strengthens the robustness of one's position. (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)

This article investigates to what extent protocols for dynamicdisputes, i.e., disputes in which the information base can vary at differentstages, can be justified in terms of logics for defeasible argumentation. Firsta general framework is formulated for dialectical proof theories for suchlogics. Then this framework is adapted to serve as a framework for protocols fordynamic disputes, after which soundness and fairness properties are formulated for such protocols relative to dialectical proof theories. It then turns out that certaintypes of protocols that are (...) perfectly fine with a static information base, arenot sound or fair in a dynamic setting. Finally, a natural dynamic protocolis defined for which soundness and fairness can be established. (shrink)

In this paper it is shown how tools developed in argumentation theory and artificial intelligence can be applied to the development of a new dialectical analysis of the speech act of making a proposal in a deliberation dialogue. These tools are developed, modified and used to formulate dialogue pre-conditions, defining conditions and post-conditions for the speech act of making a proposal in a deliberation dialogue. The defining conditions set out what is required for a move in a dialogue to count (...) as the making of a proposal by one of the parties. What is required are the conditions that (1) the move fit the requirements of the argumentation scheme for practical reasoning, and (2) the premises are propositions describing common goals of both parties or propositions that they reasonably consider means to achieve these goals. The analysis goes beyond the standard speech act approach by specifying not only the normative requirements for making a well-formed proposal, but also the requirements for responding to it by questioning or criticizing it, and the requirements for defending it. (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)

John Pollock (1940?2009) was an influential American philosopher who made important contributions to various fields, including epistemology and cognitive science. In the last 25 years of his life, he also contributed to the computational study of defeasible reasoning and practical cognition in artificial intelligence. He developed one of the first formal systems for argumentation-based inference and he put many issues on the research agenda that are still relevant for the argumentation community today. This paper presents an appreciation of Pollock's work (...) on defeasible reasoning and its relevance for the computational study of argument. In our opinion, Pollock deserves to be remembered as one of the founding fathers of the field of computational argument, while, moreover, his work contains important lessons for current research in this field, reminding us of the richness of its object of study. (shrink)

The abstract argumentation frameworks model is currently the most used tool for characterizing the justification of defeasible arguments in Artificial Intelligence. Justifications are determined on a given attack relation among arguments and are formalized as extension semantics. In this work we argue that, contrariwise to the assumptions in that model, either some argumentation frameworks are meaningless under certain concrete definitions of the attack relation, or some of the most used extension semantics in the literature, based on the defense notion of (...) admissibility, are not suitable in particular for the justification of arguments for decision making. (shrink)

This paper shows how complex argumentation, analyzed as dialectical structures, can be evaluated within a Bayesian framework by interpreting them as coherence constraints on subjective degrees of belief. A dialectical structure is a set of arguments (premiss-conclusion structure) among which support- and attack-relations hold. This approach addresses the observation that some theses in a debate can be better justified than others and thus fixes a shortcoming of a theory of defeasible reasoning which applies the bivalence principle to argument evaluations by (...) assigning them the status of being either defeated or undefeated. Evaluation procedures which are based on the principle of bivalence can, however, be embedded as a special case within the Bayesian framework. The approach developed in this paper rests on the assumptions that arguments can be reconstructed as deductively valid and that complex argumentation can be reconstructed such that premisses of arguments with equivalent conclusions are pairwise independent. (shrink)

Selinger provides a new take on what is being referred to in the computational literature as ‘structured argumentation’. In this commentary the differences and similarities with existing work are highlighted as a way of demonstrating how philosophical and computational approaches to argumentation are increasingly coming together and complementing one another.

I characterize the deductivist ideal of justification and, following to a great extent Toulmin’s work The Uses of Argument, I try to explain why this ideal is erroneous. Then I offer an alternative model of justification capable of making our claims to knowledge about substantial matters sound and reasonable. This model of justification will be based on a conception of justification as the result of good argumentation, and on a model of argumentation which is a pragmatic linguistic reconstruction of Toulmin’s (...) model of argument. (shrink)

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)

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)

Toulmin’s scheme for the layout of arguments (1958, The Uses of Argument, Cambridge University Press, Cambridge) represents an influential tool for the analysis of arguments. The scheme enriches the traditional premises-conclusion model of arguments by distinguishing additional elements, like warrant, backing and rebuttal. The present paper contains a formal elaboration of Toulmin’s scheme, and extends it with a treatment of the formal evaluation of Toulmin-style arguments, which Toulmin did not discuss at all. Arguments are evaluated in terms of a so-called (...) dialectical interpretation of their assumptions. In such an interpretation, an argument’s assumptions can be evaluated as defeated, e.g., when there is a defeating reason against the assumption. The present work builds on recent research on defeasible argumentation (cf. e.g. the work of Pollock, Reiter, Loui, Vreeswijk, Prakken, Hage and Dung). More specifically, the author’s work on the dialectical logic DEFLOG and the argumentation tool ARGUMED serve as starting points. (shrink)

Doug Walton, who died in January 2020, was a prolific author whose work in informal logic and argumentation had a profound influence on Artificial Intelligence, including Artificial Intelligence and Law. He was also very interested in interdisciplinary work, and a frequent and generous collaborator. In this paper seven leading researchers in AI and Law, all past programme chairs of the International Conference on AI and Law who have worked with him, describe his influence on their work.

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)

In The Uses of Argument, Stephen Toulmin proposed a model for the layout of arguments: claim, data, warrant, qualifier, rebuttal, backing. Since then, Toulmin’s model has been appropriated, adapted and extended by researchers in speech communications, philosophy and artificial intelligence. This book assembles the best contemporary reflection in these fields, extending or challenging Toulmin’s ideas in ways that make fresh contributions to the theory of analysing and evaluating arguments.

The problems that arise from the presence of self-attacking ar- guments and odd-length cycles of attack within argumentation frameworks are widely recognized in the literature on defeasible argumentation. This paper introduces two simple semantics to capture different intuitions about what kinds of arguments should become justified in such scenarios. These semantics are modeled upon two extensions of argumentation frameworks, which we call sustainable and tolerant. Each one is constructed on the common ground of the powerful concept of admissibility introduced by (...) Dung in [10]. The novelty of this approach consists in viewing the admissibility of a subset of arguments as relative to potentially challenging subsets of arguments. Both sustainable and tolerant semantics are more credulous than preferred semantics (i.e. they justify at least the same arguments, and possibly more). Given certain sufficient conditions they coincide among them as well as with other semantics introduced by Dung. (shrink)

The aim of this paper is to propose foundations for a formal model of representation and numerical evaluation of a possibly broad class of arguments, including those that occur in natural discourse. Since one of the most characteristic features of everyday argumentation is the occurrence of convergent reasoning, special attention should be paid to the operation ⊕, which allows us to calculate the logical force of convergent arguments with an accuracy not offered by other approaches.

Dialogue theory, although it has ancient roots, was put forward in the 1970s in logic as astructure that can be useful for helping to evaluate argumentation and informal fallacies.Recently, however, it has been taken up as a broader subject of investigation in computerscience. This paper surveys both the historical and philosophical background of dialoguetheory and the latest research initiatives on dialogue theory in computer science. The main components of dialogue theory are briefly explained. Included is a classification of the main (...) types of dialogue that, it is argued, should provide the central focus for studying many important dialogue contexts in specific cases. Following these three surveys, a concluding prediction is made about the direction dialogue theory is likely to take in the next century, especially in relation to the growing field of communication studies. (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...

It is often necessary and reasonable to justify preferences before reasoning from them. Moreover, justifying a preference ordering is reduced to justifying the criterion that produces the ordering. This paper builds on the well-known ASPIC+ formalism to develop a model that integrates justifying qualitative preferences with reasoning from the justified preferences. We first introduce a notion of preference criterion in order to model the way in which preferences are justified by an argumentation framework. We also adapt the notion of argumentation (...) theory to build a sequence of argumentation frameworks, in which an argumentation framework justifies preferences that are to underlie the next framework. That is, in our formalism, preferences become not only an input of an argumentation framework, but also an output of it. This kind of input-output process can be applied in the further steps of argumentation. We also explore some interesting properties of our formalism. (shrink)

The first issue of _Artificial Intelligence and Law_ journal was published in 1992. This paper provides commentaries on landmark papers from the first decade of that journal. The topics discussed include reasoning with cases, argumentation, normative reasoning, dialogue, representing legal knowledge and neural networks.

This paper explores the relationship between informal reasoning, creativity in mathematics, and problem solving. It underscores the importance of environments that promote interaction, hypothesis generation, examination, refutation, derivation of new solutions, drawing conclusions, and reasoning with others, as key factors in enhancing mathematical creativity. Drawing on argumentation logic, the paper proposes a novel approach to uncover specific characteristics in the development of formalized proving using “proof-events.” Argumentation logic can offer reasoning mechanisms that facilitate these environments. This paper proposes how argumentation (...) can be implemented to discover certain characteristics in the development of formalized proving with “proof-events”. The concept of a proof-event was introduced by Goguen who described mathematical proof as a multi-agent social event involving not only “classical” formal proofs, but also other informal proving actions such as deficient or alleged proofs. Argumentation is an integral component of the discovery process for a mathematical proof since a proof necessitates a dialogue between provers and interpreters to clarify and resolve gaps or assumptions. By formalizing proof-events through argumentation, this paper demonstrates how informal reasoning and conflicts arising during the proving process can be effectively simulated. The paper presents an extended version of the proof-events calculus, rooted in argumentation theories, and highlights the intricate relationships among proof, human reasoning, cognitive processes, creativity, and mathematical arguments. (shrink)

This paper develops concepts and procedures for the evaluation of complex debates. They provide means for answering such questions as whether a thesis has to be considered as proven or disproven in a debate or who carries a burden of proof. While being based on classical logic, this framework represents an (argument-based) approach to non-monotonic, or defeasible reasoning. Debates are analysed as dialectical structures, i.e. argumentation systems with an attack- as well as a support-relationship. The recursive status assignment over the (...) arguments is conditionalised on proponents in a debate. The problem of multiple status assignments arising on circular structures is solved by showing that uniqueness can be guaranteed qua reconstruction of a debate. The notion of burden of proof as well as other discursive aims rational proponents pursue in a debate is defined within the framework. (shrink)

In the current paper we re-examine the concepts of attack semantics and collective attacks in abstract argumentation, and examine how these concepts interact with each other. For this, we systematically map the space of possibilities. Starting with standard argumentation frameworks (which consist of a directed graph with nodes and arrows) we briefly state both node semantics and arrow semantics (the latter a.k.a. attack semantics) in both their extensions-based form and labellings-based form. We then proceed with SETAFs (which consist of a (...) directed hypergraph of nodes and arrows, to take into account the notion of collective attacks) and state both node semantics and arrow semantics, in both their extensions-based and labellings-based form. We then show equivalence between the extensions-based and labellings-based form, for node semantics and arrow semantics of AFs, as well as for node semantics and arrow semantics of SETAFs. Moreover, we show equivalence between node semantics and arrow semantics for AFs, and equivalence between node semantics and arrow semantics for SETAFs (with the notable exception of semi-stable). We also provide a novel way of converting a SETAF to an AF such that semantics are preserved, without the use of any “meta arguments”. Although the main part of our work is on the level of abstract argumentation, we do provide an application of our theory on the instantiated level. More specifically, we show that the classical characterisation of Assumption-Based Argumentation (ABA) can be seen as an instantiation based on a SETAF, whereas the contemporary characterisation of ABA can be seen as an instantiation based on a standard AF. Our theory of how to convert a SETAF to an AF can then be used to account for both the similarities and the differences between the classical and contemporary characterisations of ABA. Most prominently, our theory is able to explain the semantic mismatch for semi-stable semantics that arises in the ABA instantiation process. (shrink)