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)

One attractive feature of process reliabilism is its reductive potential: it promises to explain justification in entirely non-epistemic terms. In this paper, I argue that the phenomenon of epistemic defeat poses a serious challenge for process reliabilism’s reductive ambitions. The standard process reliabilist analysis of defeat is the ‘Alternative Reliable Process Account’ (ARP). According to ARP, whether S’s belief is defeated depends on whether S has certain reliable processes available to her which, if they had been used, would have resulted (...) in S not holding the belief in question. Unfortunately, ARP proves untenable. I show, by way of counterexample, that ARP fails to articulate either necessary or sufficient conditions on defeat. Process reliabilists must either provide an alternative reductive account of defeat or renounce their reductive aspirations. (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.

According to conciliatory views on the significance of disagreement, it’s rational for you to become less confident in your take on an issue in case your epistemic peer’s take on it is different. These views are intuitively appealing, but they also face a powerful objection: in scenarios that involve disagreements over their own correctness, conciliatory views appear to self-defeat and, thereby, issue inconsistent recommendations. This paper provides a response to this objection. Drawing on the work from defeasible logics paradigm and (...) abstract argumentation, it develops a formal model of conciliatory reasoning and explores its behavior in the troubling scenarios. The model suggests that the recommendations that conciliatory views issue in such scenarios are perfectly reasonable—even if outwardly they may look odd. (shrink)

This book provides a critical examination of how the choice of what to believe is represented in the standard model of belief change. In particular the use of possible worlds and infinite remainders as objects of choice is critically examined. Descriptors are introduced as a versatile tool for expressing the success conditions of belief change, addressing both local and global descriptor revision. The book presents dynamic descriptors such as Ramsey descriptors that convey how an agent’s beliefs tend to be changed (...) in response to different inputs. It also explores sentential revision and demonstrates how local and global operations of revision by a sentence can be derived as a special case of descriptor revision. Lastly, the book examines revocation, a generalization of contraction in which a specified sentence is removed in a process that may possibly also involve the addition of some new information to the belief set. (shrink)

The structural view of rational acceptance is a commitment to developing a logical calculus to express rationally accepted propositions sufficient to represent valid argument forms constructed from rationally accepted formulas. This essay argues for this project by observing that a satisfactory solution to the lottery paradox and the paradox of the preface calls for a theory that both (i) offers the facilities to represent accepting less than certain propositions within an interpreted artificial language and (ii) provides a logical calculus of (...) rationally accepted formulas that preserves rational acceptance under consequence. The essay explores the merit and scope of the structural view by observing that some limitations to a recent framework advanced James Hawthorne and Luc Bovens are traced to their framework satisfying the first of these two conditions but not the second. (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)

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)

Systems of logico-probabilistic reasoning characterize inference from conditional assertions that express high conditional probabilities. In this paper we investigate four prominent LP systems, the systems _O, P_, _Z_, and _QC_. These systems differ in the number of inferences they licence _. LP systems that license more inferences enjoy the possible reward of deriving more true and informative conclusions, but with this possible reward comes the risk of drawing more false or uninformative conclusions. In the first part of the paper, we (...) present the four systems and extend each of them by theorems that allow one to compute almost-tight lower-probability-bounds for the conclusion of an inference, given lower-probability-bounds for its premises. In the second part of the paper, we investigate by means of computer simulations which of the four systems provides the best balance of reward versus risk. Our results suggest that system _Z_ offers the best balance. (shrink)

Normic Laws and the Significance of Nonmonotonic Reasoning for Philosophy of Science. Normic laws have the form ‘if A then normally B’. They have been discovered in the explanation debate, but were considered as empirically vacuous (§1). I argue that the prototypical (or ideal) normality of normic laws implies statistical normality (§2), whence normic laws have empirical content. In §3–4 I explain why reasoning from normic laws is nonmonotonic, and why the understanding of the individual case is so important here. (...) After sketching some foundations of nonmonotonic reasoning as developed by AI-researchers (§5), Iargue that normic laws are also the best way to understand ceteris paribus laws (§6). §7 deals with the difference between physical and non-physical disciplines and §9 with the difference between normicity and approximation. In §8 it is shown how nonmonotonic reasoning provides a new understanding of the protection of theories against falsification by auxiliary hypotheses. §10, finally, gives a system- and evolution-theoretical explanation of the deeper reason for the omnipresence of normic laws in practice and science, and forthe connection between ideal and statistical normality. (shrink)

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)

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)

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)

In its present incarnation, OSCAR is a fully implemented programmable architecture for a rational agent. If we just focus upon the epistemic reasoning in OSCAR, we have a powerful general-purpose defeasible reasoner. The purpose of this paper is to describe that reasoner. OSCAR's defeasible reasoner is based upon seven fundamental ideas. These are (1) an argument-based account of defeasible reasoning, (2) an analysis of defeat-status given a set of interrelated arguments, (3) a general adequacy criterion for automated defeasible reasoners, called (...) “d.e.-adequacy”, (4) the claim that a generalpurpose defeasible reasoner must have the kind of structure I have called “flag-based”, (5) an algorithm for computing defeat-status, (6) an interest-driven monotonic reasoner, and (7) an account of degrees of justification, degrees of interest, and their interactions. These will each be discussed in turn. (shrink)

OSCAR is a fully implemented architecture for a cognitive agent, based largely on the author’s work in philosophy concerning epistemology and practical cognition. The seminal idea is that a generally intelligent agent must be able to function in an environment in which it is ignorant of most matters of fact. The architecture incorporates a general-purpose defeasible reasoner, built on top of an efficient natural deduction reasoner for first-order logic. It is based upon a detailed theory about how the various aspects (...) of epistemic and practical cognition should interact, and many of the details are driven by theoretical results concerning defeasible reasoning. The architecture is easily extensible by changing the set of inference schemes supplied to the reasoner. Existing inference schemes handle many kinds of epistemic cognition, including reasoning from perceptual input, causal reasoning and the frame problem, and reasoning defeasibly about probabilities. Work is underway to implement a system of defeasible decisiontheoretic planning. (shrink)

The question addressed in this paper is how the degree of justification of a belief is determined. A conclusion may be supported by several different arguments, the arguments typically being defeasible, and there may also be arguments of varying strengths for defeaters for some of the supporting arguments. What is sought is a way of computing the “on sum” degree of justification of a conclusion in terms of the degrees of justification of all relevant premises and the strengths of all (...) relevant reasons. (shrink)

We discuss O&C's probabilistic approach from a probability logical point of view. Specifically, we comment on subjective probability, the indispensability of logic, the Ramsey test, the consequence relation, human nonmonotonic reasoning, intervals, generalized quantifiers, and rational analysis.

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.

Additionally, the text shows how to develop computationally feasible methods to mesh with this framework.

We present a computational model of dialectical argumentation that could serve as a basis for legal reasoning. The legal domain is an instance of a domain in which knowledge is incomplete, uncertain, and inconsistent. Argumentation is well suited for reasoning in such weak theory domains. We model argument both as information structure, i.e., argument units connecting claims with supporting data, and as dialectical process, i.e., an alternating series of moves by opposing sides. Our model includes burden of proof as a (...) key element, indicating what level of support must be achieved by one side to win the argument. Burden of proof acts as move filter, turntaking mechanism, and termination criterion, eventually determining the winner of an argument. Our model has been implemented in a computer program. We demonstrate the model by considering program output for two examples previously discussed in the artificial intelligence and legal reasoning literature. (shrink)

We propose a revision operator on a stratified belief base, i.e., a belief base that stores beliefs in different strata corresponding to the value an agent assigns to these beliefs. Furthermore, the operator will be defined as to perform the revision in such a way that information is never lost upon revision but stored in a stratum or layer containing information perceived as having a lower value. In this manner, if the revision of one layer leads to the rejection of (...) some information to maintain consistency, instead of being withdrawn it will be kept and introduced in a different layer with lower value. Throughout this development we will follow the principle of minimal change, being one of the important principles proposed in belief change theory, particularly emphasized in the AGM model. Regarding the reasoning part from the stratified belief base, the agent will obtain the inferences using an argumentative formalism. Thus, the argumentation framework will decide which information prevails when sentences of different layers are used for entailing conflicting beliefs. We will also illustrate how inferences are changed and how the status of arguments can be modified after a revision process. (shrink)

The doctrinal paradox shows that aggregating individual judgments by taking a majority vote does not always yield a consistent set of collective judgments. Philip Pettit, Luc Bovens, and Wlodek Rabinowicz have recently argued for the epistemic superiority of an aggregation procedure that always yields a consistent set of judgments. This paper identifies several additional epistemic advantages of their consistency maintaining procedure. However, this paper also shows that there are some circumstances where the majority vote procedure is epistemically superior. The epistemic (...) value of maintaining consistency does not always outweigh the epistemic value of making true judgments. (shrink)

While the epistemic significance of disagreement has been a popular topic in epistemology for at least a decade, little attention has been paid to logical disagreement. This monograph is meant as a remedy. The text starts with an extensive literature review of the epistemology of (peer) disagreement and sets the stage for an epistemological study of logical disagreement. The guiding thread for the rest of the work is then three distinct readings of the ambiguous term ‘logical disagreement’. Chapters 1 and (...) 2 focus on the Ad Hoc Reading according to which logical disagreements occur when two subjects take incompatible doxastic attitudes toward a specific proposition in or about logic. Chapter 2 presents a new counterexample to the widely discussed Uniqueness Thesis. Chapters 3 and 4 focus on the Theory Choice Reading of ‘logical disagreement’. According to this interpretation, logical disagreements occur at the level of entire logical theories rather than individual entailment-claims. Chapter 4 concerns a key question from the philosophy of logic, viz., how we have epistemic justification for claims about logical consequence. In Chapters 5 and 6 we turn to the Akrasia Reading. On this reading, logical disagreements occur when there is a mismatch between the deductive strength of one’s background logic and the logical theory one prefers (officially). Chapter 6 introduces logical akrasia by analogy to epistemic akrasia and presents a novel dilemma. Chapter 7 revisits the epistemology of peer disagreement and argues that the epistemic significance of central principles from the literature are at best deflated in the context of logical disagreement. The chapter also develops a simple formal model of deep disagreement in Default Logic, relating this to our general discussion of logical disagreement. The monograph ends in an epilogue with some reflections on the potential epistemic significance of convergence in logical theorizing. (shrink)

Pollock is developing, and testing computationally a theory of rationality. I endorse his claim that the structure of argument is not always linear, his replacement of the deductive-inductive distinction with a deductive-defeasible distinction, and hi s distinction between rebutting defeaters, and undercutting defeaters. I question the absence of pragmatic constraints in his acceptance rule, an absence which fits ill with his criterion of interruptibility, that it is reasonable to act on the conclusions drawn at any point. I also wonder about (...) building a model of a rational agent in which there is no place for interpersonal argumentative discussion. (shrink)

Revision operation is the consistent expansion of a theory by a new belief-representing sentence. We consider that in a paraconsistent setting this desideratum can be accomplished in at least three distinct ways: the output of a revision operation should be either non-trivial or non-contradictory (in general or relative to the new belief). In this paper those distinctions will be explored in the constructive level by showing how the remainder sets could be refined, capturing the key concepts of paraconsistency in a (...) dynamical scenario. These are preliminaries results of a wider project on Paraconsistent Belief Change conduced by the authors. (shrink)

Mathematicians often speak of conjectures, yet unproved, as probable or well-confirmed by evidence. The Riemann Hypothesis, for example, is widely believed to be almost certainly true. There seems no initial reason to distinguish such probability from the same notion in empirical science. Yet it is hard to see how there could be probabilistic relations between the necessary truths of pure mathematics. The existence of such logical relations, short of certainty, is defended using the theory of logical probability (or objective Bayesianism (...) or non-deductive logic), and some detailed examples of its use in mathematics surveyed. Examples of inductive reasoning in experimental mathematics are given and it is argued that the problem of induction is best appreciated in the mathematical case. (shrink)

In this paper I argue that it is finally time to move beyond the Nagelian framework and to break new ground in thinking about epistemic reduction in biology. I will do so, not by simply repeating all the old objections that have been raised against Ernest Nagel’s classical model of theory reduction. Rather, I grant that a proponent of Nagel’s approach can handle several of these problems but that, nevertheless, Nagel’s general way of thinking about epistemic reduction in terms of (...) theories and their logical relations is entirely inadequate with respect to what is going on in actual biological research practice. (shrink)

The computational paradigm, which has dominated psychology and artificial intelligence since the cognitive revolution, has been a source of intense debate. Recently, several cognitive scientists have argued against this paradigm, not by objecting to computation, but rather by objecting to the notion of representation. Our analysis of these objections reveals that it is not the notion of representation per se that is causing the problem, but rather specific properties of representations as they are used in various psychological theories. Our analysis (...) suggests that all theorists accept the idea that cognitive processing involves internal information-carrying states that mediate cognitive processing. These mediating states are a superordinate category of representations. We discuss five properties that can be added to mediating states and examine their importance in various cognitive models. Finally, three methodological lessons are drawn from our analysis and discussion. (shrink)

In this chapter, we begin by sketching in the broadest possible strokes the ideas behind two formal systems that have been introduced with to goal of explicating the ways in which reasons interact to support the actions and conclusions they do. The first of these is the theory of defeasible reasoning developed in the seminal work of Pollock; the second is a more recent theory due to Horty, which adapts and develops the default logic introduced by Reiter to provide an (...) account of reasons. However, the implementations are complex enough, in both cases, to prevent anything more than this sketch. And we would not want to give the impression that we think that work on the logic of reasons must follow the path mapped out in either of these theories—indeed, we feel that the field is wide open. In the remainder of the chapter, therefore, will concentrate on a number of issues bearing on the logic of reasons that are either not treated in the work of Pollock and Horty, or whose treatment there is, we feel, either inadequate or incomplete. These are: first, the question of whether it is necessary to understand logical interactions among reasons themselves, rather than simply between reasons and the actions or conclusions they support, and if so, what principles might govern these interactions; second, priority relations among reasons and the notion of reason accrual; and third, some problems posed by undercutting defeat. (shrink)