We offer a probabilistic model of rational consequence relations (Lehmann and Magidor, 1990) by appealing to the extension of the classical Ramsey-Adams test proposed by Vann McGee in (McGee, 1994). Previous and influential models of nonmonotonic consequence relations have been produced in terms of the dynamics of expectations (Gärdenfors and Makinson, 1994; Gärdenfors, 1993).'Expectation' is a term of art in these models, which should not be confused with the notion of expected utility. The expectations of an agent are some form (...) of belief weaker than absolute certainty. Our model offers a modified and extended version of an account of qualitative belief in terms of conditional probability, first presented in (van Fraassen, 1995). We use this model to relate probabilistic and qualitative models of non-monotonic relations in terms of expectations. In doing so we propose a probabilistic model of the notion of expectation. We provide characterization results both for logically finite languages and for logically infinite, but countable, languages. The latter case shows the relevance of the axiom of countable additivity for our probability functions. We show that a rational logic defined over a logically infinite language can only be fully characterized in terms of finitely additive conditional probability. (shrink)

We contend that it is possible to argue reasonably for and against arguments from classifications and definitions, provided they are seen as defeasible (subject to exceptions and critical questioning). Arguments from classification of the most common sorts are shown to be based on defeasible reasoning of various kinds represented by patterns of logical reasoning called defeasible argumentation schemes. We show how such schemes can be identified with heuristics, or short-cut solutions to a problem. We examine a variety (...) of arguments of this sort, including argument from abductive classification, argument from causal classification, argument from analogy-based classification and arguments from classification based on generalizations. (shrink)

This paper develops a novel approach to the question of the normativity of logic, which we reinterpret as a clash between two intuitions: the direct normativity intuition and the unfeasibility intuition. The standard response has been to dismiss the direct normativity intuition, bridging logic and reasoning via principles that relativize the normative import of logic to pragmatic and feasibility considerations. We argue that the standard response is misguided. Building upon theories of bounded rationality, our approach conceptualizes reasoning as constrained by (...) multiple, independent normative factors, logical and non-logical ones. These different factors can conflict with one another, to the effect that logically sound inferences might not coincide with what is feasible for an agent to infer. From this perspective, we will argue that logic gives us only prima facie, i.e. contributive and defeasible, obligations on what to believe, but that such obligations do not always coincide with what an agent ought to believe all things considered. These distinctions will dissolve the alleged clash between the direct normativity and the unfeasibility intuition. (shrink)

One of the most important developments over the last twenty years both in logic and in Artificial Intelligence is the emergence of so-called non-monotonic logics. These logics were initially developed by McCarthy [10], McDermott & Doyle [13], and Reiter [17]. Part of the original motivation was to provide a formal framework within which to model cognitive phenomena such as defeasible inference and defeasible knowledge representation, i.e., to provide a formal account of the fact that reasoners can reach (...) conclusions tentatively, reserving the right to retract them in the light of further information. (shrink)

In recent years, the e ffort to formalize erotetic inferences (i.e., inferences to and from questions) has become a central concern for those working in erotetic logic. However, few have sought to formulate a proof theory for these inferences. To fill this lacuna, we construct a calculus for (classes of) sequents that are sound and complete for two species of erotetic inferences studied by Inferential Erotetic Logic (IEL): erotetic evocation and regular erotetic implication. While an attempt has been made to (...) axiomatize the former in a sequent system, there is currently no proof theory for the latter. Moreover, the extant axiomatization of erotetic evocation fails to capture its defeasible character and provides no rules for introducing or eliminating question-forming operators. In contrast, our calculus encodes defeasibility conditions on sequents and provides rules governing the introduction and elimination of erotetic formulas. We demonstrate that an elimination theorem holds for a version of the cut rule that applies to both declarative and erotetic formulas and that the rules for the axiomatic account of question evocation in IEL are admissible in our system. (shrink)

The applicability of Bayesian conditionalization in setting one’s posterior probability for a proposition, α, is limited to cases where the value of a corresponding prior probability, PPRI(α|∧E), is available, where ∧E represents one’s complete body of evidence. In order to extend probability updating to cases where the prior probabilities needed for Bayesian conditionalization are unavailable, I introduce an inference schema, defeasible conditionalization, which allows one to update one’s personal probability in a proposition by conditioning on a proposition that (...) represents a proper subset of one’s complete body of evidence. While defeasible conditionalization has wider applicability than standard Bayesian conditionalization (since it may be used when the value of a relevant prior probability, PPRI(α|∧E), is unavailable), there are circumstances under which some instances of defeasible conditionalization are unreasonable. To address this difficulty, I outline the conditions under which instances of defeasible conditionalization are defeated. To conclude the article, I suggest that the prescriptions of direct inference and statistical induction can be encoded within the proposed system of probability updating, by the selection of intuitively reasonable prior probabilities. (shrink)

In this paper I argue that defeasible inferences are occasion-sensitive: the inferential connections of a given claim depend on features of the circumstances surrounding the occasion of inference. More specifically, it is an occasion-sensitive matter which possible defeaters have to be considered explicitly by the premises of an inference and which possible defeaters may remain unconsidered, without making the inference enthymematic. As a result, a largely unexplored form of occasion-sensitivity arises in inferentialist theories of content that (...) appeal to defeasible inferences. (shrink)

This article begins with an introduction to defeasible (nonmonotonic) reasoning and a brief description of a computer program, EVID, which can perform such reasoning. I then explain, and illustrate with examples, how this program can be applied in computational representations of ordinary dialogic argumentation. The program represents the beliefs and doubts of the dialoguers, and uses these propositional attitudes, which can include commonsense defeasible inference rules, to infer various changing conclusions as a dialogue progresses. It is proposed (...) that computational representations of this kind are a useful tool in the analysis of dialogic argumentation, and, in particular, demonstrate the important role of defeasible reasoning in everyday arguments using commonsense reasoning. (shrink)

The study of defeasible reasoning unites epistemologists with those working in AI, in part, because both are interested in epistemic rationality. While it is traditionally thought to govern the formation and (with)holding of beliefs, epistemic rationality may also apply to the interrogative attitudes associated with our core epistemic practice of inquiry, such as wondering, investigating, and curiosity. Since generally intelligent systems should be capable of rational inquiry, AI researchers have a natural interest in the norms that govern interrogative attitudes. (...) Following its recent coinage, we use the term ``zetetic'' to refer to the properties and norms associated with the capacity to inquire. In this paper, we argue that zetetic norms can be modeled via defeasible inferences to and from questions---a.k.a erotetic inferences---in a manner similar to the way norms of epistemic rationality are represented by defeasible inference rules. We offer a sequent calculus that accommodates the unique features of ``erotetic defeat" and that exhibits the computational properties needed to inform the design of zetetic agents. The calculus presented here is an improved version of the one presented in Millson (2019), extended to cover a new class of defeasible erotetic inferences. (shrink)

The paper investigates the epistemological and communicative competences the experts need to use and communicate evidence in the reasoning process leading to diagnosis. The diagnosis and diagnosis communication are presented as intertwined processes that should be jointly addressed in medical consultations, to empower patients’ compliance in illness management. The paper presents defeasible reasoning as specific to the diagnostic praxis, showing how this type of reasoning threatens effective diagnosis communication and entails that we should understand diagnostic evidence as defeasible (...) as well. It argues that metaphors might be effective communicative devices to let the patients understand the relevant defeasors in the diagnostic reasoning process, helping to improve effective diagnosis communication, and also encouraging a change in patients’ beliefs and attitudes on their own experience of illness and illness’ management. (shrink)

This paper provides new tools for philosophical argument analysis and fresh empirical foundations for ‘critical’ ordinary language philosophy. Language comprehension routinely involves stereotypical inferences with contextual defeaters. J.L. Austin’s Sense and Sensibilia first mooted the idea that contextually inappropriate stereotypical inferences from verbal case-descriptions drive some philosophical paradoxes; these engender philosophical problems that can be resolved by exposing the underlying fallacies. We build on psycholinguistic research on salience effects to explain when and why even perfectly competent speakers cannot help making (...) stereotypical inferences which are contextually inappropriate. We analyse a classical paradox about perception, suggest it relies on contextually inappropriate stereotypical inferences from appearance-verbs, and show that the conditions we identified as leading to contextually inappropriate stereotypical inferences are met in formulations of the paradox. Three experiments use a forced-choice plausibility-ranking task to document the predicted inappropriate inferences, in English, German, and Japanese. The cross-linguistic study allows us to assess the wider relevance of the proposed analysis. Our findings open up new perspectives for ‘evidential’ experimental philosophy. (shrink)

New results in the theory of nomic probability have led to a theory of probable probabilities, which licenses defeasible inferences between probabilities that are not validated by the probability calculus. Among these are classical principles of direct inference together with some new more general principles that greatly strengthen direct inference and make it much more useful.

According to the so-called ‘Taking Condition’ (a label due to Boghossian 2014) on inference, for a response R in circumstances C to count as an instance of reasoning or inferring, it must be the case that the agent’s taking it that R is warranted or justified in C plays (the right sort of) explanatory role in her R-ing. The Taking Condition has come under much criticism in the theory of reasoning. While I believe that these criticisms can be answered, (...) my aim in this paper is to build a positive case for the Taking Condition. More specifically, I argue that views based on the Taking Condition do a much better job accounting for crucial features of reasoning—especially once we recognize the pervasiveness and significance of defeasibility in our reasoning. (shrink)

This paper presents a number of apparent anomalies in rational choice scenarios, and their translation into the logic of everyday reasoning. Three classes of examples that have been discussed in the context of probabilistic choice since the 1960s (by Debreu, Tversky and others) are analyzed in a non-probabilistic setting. It is shown how they can at the same time be regarded as logical problems that concern the drawing of defeasible inferences from a given information base. I argue that initial (...) appearances notwithstanding, these cases should not be classed as instances of irrationality in choice or reasoning. One way of explaining away their apparent oddity is to view certain aspects of these examples as making particular options salient. The decision problems in point can then be solved by ‘picking’ these options, although they could not have been ‘chosen’ in a principled way, due to ties or incomparabilities with alternative options. (shrink)

. Artificial Intelligence (AI) has long dealt with the issue of finding a suitable formalization for commonsense reasoning. Defeasible argumentation has proven to be a successful approach in many respects, proving to be a confluence point for many alternative logical frameworks. Different formalisms have been developed, most of them sharing the common notions of argument and warrant. In defeasible argumentation, an argument is a tentative (defeasible) proof for reaching a conclusion. An argument is warranted when it ultimately (...) prevails over other conflicting arguments. In this context, defeasible consequence relationships for modelling argument and warrant as well as their logical properties have gained particular attention. This article analyzes two non-monotonic inference operators Carg and Cwar intended for modelling argument construction and dialectical analysis (warrant), respectively. As a basis for such analysis we will use the LDSar framework, a unifying approach to computational models of argument using Labelled Deductive Systems (LDS). In the context of this logical framework, we show how labels can be used to represent arguments as well as argument trees, facilitating the definition and study of non-monotonic inference operators, whose associated logical properties are studied and contrasted. We contend that this analysis provides useful comparison criteria that can be extended and applied to other argumentation frameworks. (shrink)

In this paper we propose an extension of Defeasible Logic to represent and compute different concepts of defeasible permission. In particular, we discuss some types of explicit permissive norms that work as exceptions to opposite obligations or encode permissive rights. Moreover, we show how strong permissions can be represented both with, and without introducing a new consequence relation for inferring conclusions from explicit permissive norms. Finally, we illustrate how a preference operator applicable to contrary-to-duty obligations can be combined (...) with a new operator representing ordered sequences of strong permissions. The logical system is studied from a computational standpoint and is shown to have linear computational complexity. (shrink)

This contribution aims at providing an argumentative method to account for epistemic modality and evidentiality. I claim that these two linguistic categories can work as semantic components of defeasible argumentative schemes based on classification processes. This kind of approximate reasoning is, in fact, frequently indicated by appearance verbs which signal that the inferred standpoint is conceived by the speaker as uncertain due to the deceiving nature of perceptual data. Drawing from an analysis at the semantic-argumentative interface, the way in (...) which prototype theory sheds light on the processes of meaning construction underlying defeasible arguments from definition is also shown. (shrink)

Non-monotonicity in logic is a symptom that may have many causes. In the formalisation of defeasible reasoning, an epistemic diagnosis has largely prevailed according to which some inferences are non-monotonic because they are provisionally drawn in the absence of relevant or complete information. The Gabbay-Makinson rules for cumulative consequence relations are a paradigmatic example of this epistemic approach. In this paper a different approach to defeasible reasoning is introduced, based on the idea of inferential perspectives. According to this (...) approach, some inferences are non-monotonic because they are drawn as from another reasoner’s perspective. Rules are introduced and discussed for a Perspectival Calculus, which show both similarities and interesting differences with respect to cumulative systems. (shrink)

Following Marr (1982), any computational account of cognition must satisfy constraints at three explanatory levels: computational, algorithmic, and implementational. This paper focuses on the first two levels and argues that current theories of reasoning cannot provide explanations of everyday defeasible reasoning, at either level. At the algorithmic level, current theories are not computationally tractable: they do not “scale-up” to everyday defeasible inference. In addition, at the computational level, they cannot specify why people behave as they do both (...) on laboratory reasoning tasks and in everyday life (Anderson, 1990). In current theories, logic provides the computational-level theory, where such a theory is evident at all. But logic is not a descriptively adequate computational-level theory for many reasoning tasks. It is argued that better computational-level theories can be developed using a probabilistic framework. This approach is illustrated using Oaksford and Chater's (1994) probabilistic account of Wason's selection task. (shrink)

On a purely epistemic understanding of experimental realism, manipulation affords a particularly robust kind of causal warrant, which is – like any other warrant – defeasible. I defend a version of Nancy Cartwright’s inference to the most likely cause, and I conclude that this minimally epistemic version of experimental realism is a coherent, adequate and plausible epistemology for science.

In this paper we will analyse the issue of defeasibility in the law, taking into account research carried out in philosophy, artificial intelligence and legal theory. We will adopt a very general idea of legal defeasibility, in which we will include all different ways in which certain legal conclusions may need to be abandoned, though no mistake was made in deriving them. We will argue that defeasibility in the law involves three different aspects, which we will call inference‐based defeasibility, (...) process‐based defeasibility, and theory‐based defeasibility. Only the integration of these three perspectives allows us to provide a satisfactory account of the role of defeasibility in legal reasoning. (shrink)

In this paper two theories of defeasible reasoning, Pollock's account and my theory of ranking functions, are compared, on a strategic level, since a strictly formal comparison would have been unfeasible. A brief summary of the accounts shows their basic difference: Pollock's is a strictly computational one, whereas ranking functions provide a regulative theory. Consequently, I argue that Pollock's theory is normatively defective, unable to provide a theoretical justification for its basic inference rules and thus an independent notion (...) of admissible rules. Conversely, I explain how quite a number of achievements of Pollock's account can be adequately duplicated within ranking theory. The main purpose of the paper, though, is not to settle a dispute with formal epistemology, but rather to emphasize the importance of formal methods to the whole of epistemology. (shrink)

Natural languages make prolific use of conventional constituent‐ordering patterns to indicate “who did what to whom,” yet the mechanisms through which these regularities arise are not well understood. A series of recent experiments demonstrates that, when prompted to express meanings through silent gesture, people bypass native language conventions, revealing apparent biases underpinning word order usage, based on the semantic properties of the information to be conveyed. We extend the scope of these studies by focusing, experimentally and computationally, on the interpretation (...) of silent gesture. We show cross‐linguistic experimental evidence that people use variability in constituent order as a cue to obtain different interpretations. To illuminate the computational principles that govern interpretation of non‐conventional communication, we derive a Bayesian model of interpretation via biased inductive inference and estimate these biases from the experimental data. Our analyses suggest people's interpretations balance the ambiguity that is characteristic of emerging language systems, with ordering preferences that are skewed and asymmetric, but defeasible. (shrink)

Standards and norms for reasoning function, in part, to manage epistemic risk. Properly used, modal qualifiers like presumably have a role in systematically managing epistemic risk by flagging and tracking type-specific epistemic merits and risks of the claims they modify. Yet, argumentation-theoretic accounts of presumption often define it in terms of modalities of other kinds, thereby failing to recognize the unique risk profile of each. This paper offers a stipulative account of presumption, inspired by Ullmann-Margalit, as an inferentially generated modal (...) qualifier, “presumably, p,” distinguishing it from other, particularly epistemic modalities, e.g., standing commitments, assumptions, assertions, suppositions, hypotheses, and defeasible claims. By avoiding the tranching of inferential instruments of qualitatively different bona fides and risk profiles, this account provides a more accurate risk-rating system that better manages epistemic risk in inference, as well as contributing to the normative theory of the operation of presumption in reasoning and argument. (shrink)

The goal of this dissertation is to offer a practice-based account of intentionality. My aim is to examine what sort of practices agents have to engage in so as to count as talking and thinking about the way the world is – that is, what sort of practices count as representational. Representational practices answer to the way the world is: what is correct within such practices depends on the way things are, rather than on the attitudes of agents. An account (...) of representation must explain how such objective standards of correctness are introduced in human practices: one must explain how the world gets to have a say in what is correct in human discursive practices. Roughly, my proposal is that human discursive practices become responsive to the way things are by virtue of involving practical interactions with the world. The outcomes of these interactions depend on the way the world is and the evaluation of such outcomes contributes to determining which moves within the practice count as correct. Due to our practical engagement with the environment, thus, the world gets to constrain discursive practices. In order to flesh out my proposal, I develop a practice-based characterization of intentional or representational content. On this sort of approach, expressing intentional contents is seen as a matter of playing a certain role in relevant practices, rather than as a matter of engaging in some word-world relation. The expression of content, thus, is explained in terms of use. In particular, I adopt an inferentialist perspective, according to which discursive moves express contents because of their role in practices of giving and asking for reasons. I investigate how practical engagement with the environment introduces friction with the world in these practices of giving and asking for reasons. One of the main conclusions reached in the dissertation is that defeasibility is an essential feature of objective representational practices – so that attributions of representational correctness are revisable in an open-ended way. The discussion of defeasible reasoning – and of the way in which defeasibility shapes human representational practices – is a central point of this dissertation. (shrink)

This paper presents an information-based logic that is applied to the analysis of entailment, implicature and presupposition in natural language. The logic is very fine-grained and is able to make distinctions that are outside the scope of classical logic. It is independently motivated by certain properties of natural human reasoning, namely partiality, paraconsistency, relevance, and defeasibility: once these are accounted for, the data on implicature and presupposition comes quite naturally.The logic is based on the family of semantic spaces known as (...) bilattices, originally proposed by Ginsberg (1988), and used extensively by Fitting (1989, 1992). Specifically, the logic is based on a subset of bilattices that I call evidential bilattices, constructed as the Cartesian product of certain algebras with themselves. The specific details of the epistemic agent approach of the logical system is derived from the work of Belnap (1975, 1977), augmented by the use of evidential links for inferencing. An important property of the system is that it has been implemented using an extension of Fitting's work on bilattice logic programming (1989, 1991) to build a model-based inference engine for the augmented Belnap logic. This theorem prover is very efficient for a reasonably wide range of inferences. (shrink)

The purpose of this paper is to analyze the structure and the defeasibility conditions of argument from analogy, addressing the issues of determining the nature of the comparison underlying the analogy and the types of inferences justifying the conclusion. In the dialectical tradition, different forms of similarity were distinguished and related to the possible inferences that can be drawn from them. The kinds of similarity can be divided into four categories, depending on whether they represent fundamental semantic features of the (...) terms of the comparison or non-semantic ones, indicating possible characteristics of the referents. Such distinct types of similarity characterize different kinds of analogical arguments, all based on a similar general structure, in which a common genus is abstracted. Depending on the nature of the abstracted common feature, different rules of inference will apply, guaranteeing the attribution of the analogical predicate to the genus and to the primary subject. This analysis of similarity and the relationship thereof with the rules of inference allows a deeper investigation of the defeasibility conditions. (shrink)

On a purely epistemic understanding of experimental realism, manipulation affords a particularly robust kind of causal warrant, which is – like any other warrant – defeasible. I defend a version of Nancy Cartwright’s inference to the most likely cause, and I conclude that this minimally epistemic version of experimental realism is a coherent, adequate and plausible epistemology for science.

Our paper addresses the problem of a two-fold approach to skeptical inferences in the context non-monotonic logics. We tackle the problem through the analysis of ambiguous theories, such as the Nixon Diamond, as instantiated in non-monotonic inheritance networks, and the notion of an extension. Our paper presents a detailed description of the inner mechanisms underlying both approaches to skeptical inference, i.e. direct and indirect skepticism, and how each information processing policy is applied to ambiguous networks like the Nixon Diamond. (...) Finally, we discuss the extent and limitation of each approach, and we propose an alternative stance towards the existence of diverging implementations to skeptical inferences in non-monotonic reasoning. (shrink)

The explanation of the suppression of Modus Ponens inferences within the framework of linguistic pragmatics and of plausible reasoning (i.e., deduction from uncertain premises) is defended. First, this approach is expounded, and then it is shown that the results of the first experiment of Byrne, Espino, and Santamar a (1999) support the uncertainty explanation but fail to support their counterexample explanation. Second, two experiments are presented. In the first one, aimed to refute one objection regarding the conclusions observed, the additional (...) conditional premise ( if N, C ) was replaced with a statement of uncertainty ( it is not certain that N ); the answers produced by the participants remained qualitatively and quantitatively similar in both conditions. In the second experiment, a fine-grained analysis of the responses to and justifications for an evaluation task was performed. The results of both experiments strongly supported the uncertainty explanation. (shrink)

Corroborative evidence has a dual function in argument. Primarily, it functions to provide direct evidence supporting the main conclusion. But it also has a secondary, bolstering function which increases the probative value of some other piece of evidence in the argument. This paper argues that the bolstering effect of corroborative evidence is legitimate, and can be explained as counter–rebuttal achieved through inference to the best explanation. A model (argument diagram) of corroborative evidence, representing its structure and operation as a (...) schematic pattern of defeasible argument is also supplied. In addition to explaining the operation and theoretical foundation of corroborative evidence, the model facilitates the correct analysis and guides the evaluation (assessment and critique) of corroborative evidence as it occurs in argument. (shrink)

Recently, John Bell has proposed that a specific conditional logic, C, be considered as a serious candidate for formally representing and faithfully capturing various (possibly all) formalized notions of nonmonotonic inference. The purpose of the present paper is to develop evaluative criteria for critically assessing such claims. Inference patterns are described in terms of the presence or absence of residual classical monotonicity and intrinsic nonmonotonicity. The concept of a faithful representation is then developed for a formalism purported to (...) encode a pattern of nonmonotonic inference already captured by another. In the main body of the paper these evaluative criteria are applied to assess (negatively) whether C or any conditional logic provides a faithful representation for nonmonotonic patterns of inference captured by inference operators and relations modeling the dynamics of belief change. (shrink)

This paper is about the pragmatic inferences in play as conversational implicatures (Grice, P. 1989. Studies in the way of words. Cambridge, MA: Harvard University Press) occur. First, it constructs the deductivism versus abductivism debate that transpires from the extant literature but is rarely elaborated. Against deductivism, the paper argues that implicating inferences in conversational implicatures can instantiate an abductive logical form, as abductivism suggests. Against abductivism, however, it grants to deductivism that implicating inferences can have a deductive form provided (...) the latter is of a defeasible type. In sum, it thus argues for pluralist defeasibilism. Second, it turns to the issue of the ontological nature of implicating inferences and advocates normative inferentialism, on which these inferences are not primarily real psychological processes but rules of the practice of implicating. While this allows for the possibility of their psychological instantiation, to be sure, the paper also insists that psychological inferring processes in implicatures are neither necessarily isomorphic to the aforementioned rules nor even necessarily occur as an implicature occurs. (shrink)

The knowledge representation and reasoning of both humans and artificial systems often involves conditionals. A conditional connects a consequence which holds given a precondition. It can be easily recognized in natural languages with certain key words, like “if” in English. A vast amount of literature in both fields, both artificial intelligence and psychology, deals with the questions of how such conditionals can be best represented and how these conditionals can model human reasoning. On the other hand, findings in the psychology (...) of reasoning, such as those in the Suppression Task, have led to a paradigm shift from the monotonicity assumptions in human inferences towards nonmonotonic reasoning. Nonmonotonic reasoning is sensitive for information change, that is, inferences are drawn cautiously such that retraction of previous information is not required with the addition of new information. While many formalisms of nonmonotonic reasoning have been proposed in the field of Artificial Intelligence, their capability to model properties of human reasoning has not yet been extensively investigated. In this paper, we analyzed systematically from both a formal and an empirical perspective the power of formal nonmonotonic systems to model possible explicit defeaters, as in the Suppression Task, and more implicit conditional rules that trigger nonmonotonic reasoning by the keywords in such rules. The results indicated that the classical evaluation for the correctness of inferences has to be extended in the three major aspects regarding the inference system, the knowledge base, and possible assumed exceptions for the rule. (shrink)

Natural languages make prolific use of conventional constituent‐ordering patterns to indicate “who did what to whom,” yet the mechanisms through which these regularities arise are not well understood. A series of recent experiments demonstrates that, when prompted to express meanings through silent gesture, people bypass native language conventions, revealing apparent biases underpinning word order usage, based on the semantic properties of the information to be conveyed. We extend the scope of these studies by focusing, experimentally and computationally, on the interpretation (...) of silent gesture. We show cross‐linguistic experimental evidence that people use variability in constituent order as a cue to obtain different interpretations. To illuminate the computational principles that govern interpretation of non‐conventional communication, we derive a Bayesian model of interpretation via biased inductive inference and estimate these biases from the experimental data. Our analyses suggest people's interpretations balance the ambiguity that is characteristic of emerging language systems, with ordering preferences that are skewed and asymmetric, but defeasible. (shrink)

This interdisciplinary work is a collection of major essays on reasoning: deductive, inductive, abductive, belief revision, defeasible, cross cultural, conversational, and argumentative. They are each oriented toward contemporary empirical studies. The book focuses on foundational issues, including paradoxes, fallacies, and debates about the nature of rationality, the traditional modes of reasoning, as well as counterfactual and causal reasoning. It also includes chapters on the interface between reasoning and other forms of thought. In general, this last set of essays represents (...) growth points in reasoning research, drawing connections to pragmatics, cross-cultural studies, emotion and evolution. (shrink)

An adequate semantics for generic sentences must stake out positions across a range of contested territory in philosophy and linguistics. For this reason the study of generic sentences is a venue for investigating different frameworks for understanding human rationality as manifested in linguistic phenomena such as quantification, classification of individuals under kinds, defeasible reasoning, and intensionality. Despite the wide variety of semantic theories developed for generic sentences, to date these theories have been almost universally model-theoretic and representational. This essay (...) outlines a range of proof-theoretic analyses for characterizing generics. Particular attention is given to an expressivist proof-theory that can be traced to 1) work on logical syntax that Carnap undertook prior to his turn toward truth-conditional model theory in the late 1930s, and 2) research on sequent calculi and natural deduction systems that originate in work from Gentzen and Prawitz.11 This essay offers a more precise exposition of some of the material discussed in the first two chapters of my dissertation (Stovall Citation2015a). These ideas developed in the context of a working group on non-monotonic logic run by Robert Brandom, and they were subsequently clarified through the work of Nissim Francez (particularly Francez Citation2015). I am indebted to many people for feedback and criticism on this essay, though I am sure none among them would agree with everything I say and do here. I would particularly like to thank Brandom, Francez, Ulf Hlobil, Daniel Kaplan, Jared Millson, Bernhard Nickel, Jaroslav Peregrin, Jeffry Pelletier, Thomas Ricketts, Mark Risjord, Shawn Standefer, and two reviewers for this journal. Work on this essay was supported by the joint Lead-Agency research grant between the Austrian Science Foundation (FWF) and the Czech Science Foundation (GAČR), Inferentialism and Collective Intentionality, GF17-33808L. It was substantially revised prior to its final submission. (shrink)

A. Tarski [22] proposed the study of infinitary consequence operations as the central topic of mathematical logic. He considered monotonicity to be a property of all such operations. In this paper, we weaken the monotonicity requirement and consider more general operations, inference operations. These operations describe the nonmonotonic logics both humans and machines seem to be using when infering defeasible information from incomplete knowledge. We single out a number of interesting families of inference operations. This study of (...) infinitary inference operations is inspired by the results of [12] on nonmonotonic inference relations, and relies on some of the definitions found there. (shrink)

Efforts to formalize qualitative accounts of inference to the best explanation (IBE) confront two obstacles: the imprecise nature of such accounts and the unusual logical properties that explanations exhibit, such as contradiction-intolerance and irreflexivity. This paper aims to surmount these challenges by utilising a new, more precise theory that treats explanations as expressions that codify defeasible inferences. To formalise this account, we provide a sequent calculus in which IBE serves as an elimination rule for a connective that exhibits (...) many of the properties associated with the behaviour of the English expression ‘That... best explains why ... ’. We first construct a calculus that encodes these properties at the level of the turnstile, i.e. as a metalinguistic expression for classes of defeasible consequence relations. We then show how this calculus can be conservatively extended over a language that contains a best-explains-why operator. (shrink)

Classical symbolic computational models of cognition are at variance with the empirical findings in the cognitive psychology of memory and inference. Standard symbolic computers are well suited to remembering arbitrary lists of symbols and performing logical inferences. In contrast, human performance on such tasks is extremely limited. Standard models donot easily capture content addressable memory or context sensitive defeasible inference, which are natural and effortless for people. We argue that Connectionism provides a more natural framework in which (...) to model this behaviour. In addition to capturing the gross human performance profile, Connectionist systems seem well suited to accounting for the systematic patterns of errors observed in the human data. We take these arguments to counter Fodor and Pylyshyn's (1988) recent claim that Connectionism is, in principle, irrelevant to psychology. (shrink)

Both in formal and computational natural language semantics, the classical correspondence view of meaning – and, more specifically, the view that the meaning of a declarative sentence coincides with its truth conditions – is widely held. Truth (in the world or a situation) plays the role of the given, and meaning is analysed in terms of it. Both language and the world feature in this perspective on meaning, but language users are conspicuously absent. In contrast, the inferentialist semantics that Robert (...) Brandom proposes in his magisterial book ‘Making It Explicit’ puts the language user centre stage. According to his theory of meaning, the utterance of a sentence is meaningful in as far as it is a move by a language user in a game of giving and asking for reasons (with reasons underwritten by a notion of good inferences). In this paper, I propose a proof-theoretic formalisation of the game of giving and asking for reasons that lends itself to computer implementation. In the current proposal, I flesh out an account of defeasible inferences, a variety of inferences which play a pivotal role in ordinary (and scientific) language use. (shrink)

The Lottery Paradox has been thought to provide a reductio argument against probabilistic accounts of inductive inference. As a result, much work in artificial intelligence has concentrated on qualitative methods of inference, including default logics, which are intended to model some varieties of inductive inference. It has recently been shown that the paradox can be generated within qualitative default logics. However, John Pollock's qualitative system of defeasible inference, does avoid the Lottery Paradox by incorporating a (...) rule designed specifically for that purpose. I shall argue that Pollock's system instead succumbs to a worse disease: it fails to allow for induction at all. (shrink)

Since its inception, situation theory has been concerned with the situated nature of meaning and cognition, a theme which has also recently gained some prominence in Artificial Intelligence. Channel theory is a recently developed framework which builds on concepts introduced in situation theory, in an attempt to provide a general theory of information flow. In particular, the channel theoretic framework offers an account of fallible regularities, regularities which provide enough structure to an agent's environment to support efficient cognitive processing but (...) which are limited in their reliability to specific circumstances. This paper describes how this framework can lead to a different perspective on defeasible reasoning: rather than being seen as reasoning with incomplete information, an agent makes use of a situated regularity, choosing to use the regularity that seems best suited (trading off reliability and simplicity) to the circumstances it happens to find itself in. We present a formal model for this task, based on the channel theoretic framework, and sketch how the model may be used as the basis for a methodology of defeasible situated reasoning, whereby agents reason with simple monotonic regularities but may revise their choice of regularity on learning more about their circumstances. (shrink)

This article concerns the structure of defeasible arguments like: 'If Bob has red spots, Bob has the measles; Bob has red spots; therefore Bob has the measles.' The issue is whether such arguments have the form of modus ponens or not. Either way there is a problem. If they don't have the form of modus ponens, the common opinion to the contrary taught in leading logic textbooks is wrong. But if they do have the form of modus ponens, doubts (...) are raised about the conventional dogma that all arguments having the form of modus ponens are deductively valid. By carefully examining arguments on both sides of the issue, reasonable doubts are raised about the view that all arguments having a modus ponens form are valid. (shrink)

Modal logics have in the past been used as a unifying framework for the minimality semantics used in defeasible inference, conditional logic, and belief revision. The main aim of the present paper is to add adaptive logics, a general framework for a wide range of defeasible reasoning forms developed by Diderik Batens and his co-workers, to the growing list of formalisms that can be studied with the tools and methods of contemporary modal logic. By characterising the class (...) of abnormality models, this aim is achieved at the level of the model-theory. By proposing formulae that express the consequence relation of adaptive logic in the object-language, the same aim is also partially achieved at the syntactical level. (shrink)

Decision-makers in governments, enterprises, businesses and agencies or individuals, typically, make decisions according to various regulations, guidelines and policies based on existing records stored in various databases, in particular, relational databases. To assist decision-makers, an expert system, encompasses interactive computer-based systems or subsystems to support the decision-making process. Typically, most expert systems are built on top of transaction systems, databases, and data models and restricted in decision-making to the analysis, processing and presenting data and information, and they do not provide (...) support for the normative layer. This paper will provide a solution to one specific problem that arises from this situation, namely the lack of tool/mechanism to demonstrate how an expert system is well-suited for supporting decision-making activities drawn from existing records and relevant legal requirements aligned existing records stored in various databases.We present a Rule-based reporting systems architecture, which is intended to integrate databases, in particular, relational databases, with a logic-based reasoner and rule engine to assist in decision-making or create reports according to legal norms. We argue that the resulting RuleRS provides an efficient and flexible solution to the problem at hand using defeasible inference. To this end, we have also conducted empirical evaluations of RuleRS performance. (shrink)