We investigate the notion of relevance as it pertains to ‘commonsense’, subjunctive conditionals. Relevance is taken here as a relation between a property (such as having a broken wing) and a conditional (such as birds typically fly). Specifically, we explore a notion of ‘causative’ relevance, distinct from ‘evidential’ relevance found, for example, in probabilistic approaches. A series of postulates characterising a minimal, parsimonious concept of relevance is developed. Along the way we argue that no purely logical account of relevance (even (...) at the metalevel) is possible. Finally, and with minimal restrictions, an explicit definition that agrees with the postulates is given. (shrink)

This article argues that: (i) Defeasible reasoning is the use of distinctive procedures for belief revision when new evidence or new authoritative judgment is interpolated into a system of beliefs about an application domain. (ii) These procedures can be explicated and implemented using standard higher-order logic combined with epistemic assumptions about the system of beliefs. The procedures mentioned in (i) depend on the explication in (ii), which is largely described in terms of a Prolog program, EVID, which implements a system (...) for interactive, defeasible reasoning when combined with an application knowledge base. It is shown that defeasible reasoning depends on a meta-level Closed World Assumption applied to the relationship between supporting evidence and a defeasible conclusion based on this evidence. Thesis (i) is then further defended by showing that the EVID explication of defeasible reasoning has sufficient representational power to cover a wide variety of practical applications of defeasible reasoning, especially in the context of decision making. (shrink)

A non-monotonic logic, the Logic of Plausible Reasoning (LPR), capable of coping with the demands of what we call complex reasoning, is introduced. It is argued that creative complex reasoning is the way of reasoning required in many instances of scientific thought, professional practice and common life decision taking. For managing the simultaneous consideration of multiple scenarios inherent in these activities, two new modalities, weak and strong plausibility, are introduced as part of the Logic of Plausible Deduction (LPD), a deductive (...) logic specially designed to serve as the monotonic support for LPR. Axiomatics and semantics for LPD, together with a completeness proof, are provided. Once LPD has been given, LPR may be defined via a concept of extension over LPD. Although the construction of LPR extensions is first presented in standard style, for the sake of comparison with existing non-monotonic formalisms, alternative more elegant and intuitive ways for constructing non-monotonic LPR extensions are also given and proofs of their equivalence are presented. (shrink)

We introduce a family of preferential logics that are useful for handling information with different levels of uncertainty. The corresponding consequence relations are nonmonotonic, paraconsistent, adaptive, and rational. It is also shown that the formalisms in this family can be embedded in corresponding four-valued logics with at most three uncertainty levels, and that reasoning with these logics can be simulated by algorithms for processing circumscriptive theories, such as DLS and SCAN.

The distinction between distributive and non-distributive profiles figures prominently in current evaluations of the ethical and epistemological risks that are associated with automated profiling practices. The diagnosis that non-distributive profiles may coincidentally situate an individual in the wrong category is often perceived as the central shortcoming of such profiles. According to this diagnosis, most risks can be retraced to the use of non-universal generalisations and various other statistical associations. This article develops a top-down analysis of non-distributive profiles in which this (...) fallibility of non-distributive profiles is no longer central. Instead, it focuses on how profiling creates various asymmetries between an individual data-subject and a profiler. The emergence of informational, interest, and perspectival asymmetries between data-subject and profiler explains how non-distributive profiles weaken the epistemic position of a profiled individual. This alternative analysis provides a more balanced assessment of the epistemic risks associated with non-distributive profiles. (shrink)

We investigate induction from the viewpoint of nonmonotonic reasoning. Induction we consider in this paper is descriptive induction. Hypotheses from descriptive induction have the weak property that they only describe rules with respect to the observations and do not realize an inductive leap. In this paper, we define a new form of descriptive induction with circumscription and the idea of explanation and show two procedures for computing it. The new descriptive induction is called circumscriptive induction. By deciding the roles of (...) predicates in circumscription, we can intentionally minimize models of a given inductive problem. By adopting the idea of explanation, we can distinguish between background knowledge and observations. Additionally, we consider the relationship between the way of choosing the roles of predicates in computing circumscription and the property of hypotheses obtained by circumscriptive induction. It is shown that hypotheses from circumscriptive induction reflect a difference between background knowledge and observations and do not realize an inductive leap. We also investigate revision of hypotheses which is as important as generation of hypotheses. In a process of hypothesis revision, a difference between previous induction and circumscriptive induction is clearly characterised. (shrink)

Le projet philosophique puise ses sources dans la volonté de proposer une explication rationnelle des phénomènes naturels et culturels qui constituent le monde dans lequel l’être humain prend place. Il a servi de trame culturelle à l’Occident et amené le déploiement d’appareils conceptuels où l’on distingue théorie et pratique. On doit toutefois reconnaître qu’une philosophie théorique peut avoir une portée pratique et l’inverse, puisque toute pratique suppose un ancrage théorique pour légitimer la connaissance et les systèmes normatifs à partir desquels (...) les explications sont avancées. Cela fait dire à certains que la distinction est désormais surannée et qu’une théorie philosophique réunifiée s’impose. Que l’on soit tenant de la tradition ou des nouvelles approches, la philosophie pratique s’impose désormais comme un passage obligé pour réfléchir les problèmes et articuler de nouvelles théories faisant écho à l’état actuel de notre monde. Le présent ouvrage revient sur la notion de philosophie pratique afin d’en faire voir les différentes acceptions et manières de la mobiliser pour réfléchir à des problèmes actuels. (shrink)

Default logic has been a very active research topic in artificial intelligence since the early 1980s, but has not received as much attention in the philosophical literature thus far. This paper shows one way in which the technical tools of artificial intelligence can be applied in contemporary epistemology by modeling a paradigmatic case of deep disagreement using default logic. In §1 model-building viewed as a kind of philosophical progress is briefly motivated, while §2 introduces the case of deep disagreement we (...) aim to model. On the heels of this, §3 defines our formal framework, viz., a refined Horty-style default logic. §4 then uses the framework to model deep disagreement, and finally §5 provides a critical discussion of the result. (shrink)

Esta enciclopédia abrange, de uma forma introdutória mas desejavelmente rigorosa, uma diversidade de conceitos, temas, problemas, argumentos e teorias localizados numa área relativamente recente de estudos, os quais tem sido habitual qualificar como «estudos lógico-filosóficos». De uma forma apropriadamente genérica, e apesar de o território teórico abrangido ser extenso e de contornos por vezes difusos, podemos dizer que na área se investiga um conjunto de questões fundamentais acerca da natureza da linguagem, da mente, da cognição e do raciocínio humanos, bem (...) como questões acerca das conexões destes com a realidade não mental e extralinguística. A razão daquela qualificação é a seguinte: por um lado, a investigação em questão é qualificada como filosófica em virtude do elevado grau de generalidade e abstracção das questões examinadas (entre outras coisas); por outro, a investigação é qualificada como lógica em virtude de ser uma investigação logicamente disciplinada, no sentido de nela se fazer um uso intenso de conceitos, técnicas e métodos provenientes da disciplina de lógica. O agregado de tópicos que constitui a área de estudos lógico-filosóficos é já visível, pelo menos em parte, no Tractatus Logico-Philosophicus de Ludwig Wittgenstein, uma obra publicada em 1921. E uma boa maneira de ter uma ideia sinóptica do território disciplinar abrangido por esta enciclopédia, ou pelo menos de uma porção substancial dele, é extrair do Tractatus uma lista dos tópicos mais salientes aí discutidos; a lista incluirá certamente tópicos do seguinte género, muitos dos quais se podem encontrar ao longo desta enciclopédia: factos e estados de coisas; objectos; representação; crenças e estados mentais; pensamentos; a proposição; nomes próprios; valores de verdade e bivalência; quantificação; funções de verdade; verdade lógica; identidade; tautologia; o raciocínio matemático; a natureza da inferência; o cepticismo e o solipsismo; a indução; as constantes lógicas; a negação; a forma lógica; as leis da ciência; o número. (shrink)

Based on a close study of benchmark examples in default reasoning, such as Nixon Diamond, Penguin Principle, etc., this paper provides an in depth analysis of the basic features of default reasoning. We formalize default inferences based on Modus Ponens for Default Implication, and mark the distinction between "local inferences"(to infer a conclusion from a subset of given premises) and "global inferences"(to infer a conclusion from the entire set of given premises). These conceptual analyses are captured by a formal semantics (...) that is built upon the set-selection function technique. A minimal logic system M of default reasoning that accommodates Modus Ponens for Default Implication and suitable for local inferences is proposed, and its soundness is proved. (shrink)

This paper deals with the exceptions-tolerance property of generic sentences with indefinite singular and bare plural subjects (IS and BP generics, respectively) and with the way this property is connected to some well-known observations about felicity differences between the two types of generics (e.g. Lawler's 1973, Madrigals are popular vs. #A madrigal is popular). I show that whereas both IS and BP generics tolerate exceptional and contextually irrelevant individuals and situations in a strikingly similar way, which indicates the existence of (...) a basically equivalent tolerance mechanism, there is also a difference between them, unnoticed so far, which concerns the degree to which the properties of the legitimate exceptions can be characterized in advance. Following claims in Greenberg (2003), I argue that both this newly observed difference as well as the traditional felicity differences result from an underlying contrast in the type of ‘non-accidentalness’ expressed by the two types of generic sentences, and more formally, in the accessibility relations that their generic quantifier (Gen) is compatible with. To capture the new difference in tolerance of exceptions, I develop an improved version of the exceptions-tolerance mechanism for generic sentences suggested in Kadmon & Landman (1993), namely, a restriction on the set of individuals and situations quantified by Gen, which is partially vague to two different degrees using supervaluationist methods. The different degrees of vagueness in this restriction are shown to be systematically dependent on the two types of accessibility relations that IS and BP generics are compatible with, which are redefined as precise and vague restrictions on the generic quantification over worlds. (shrink)

The Local Computation Framework has been used to improve the efficiency of computation in various uncertainty formalisms. This paper shows how the framework can be used for the computation of logical deduction in two different ways; the first way involves embedding model structures in the framework; the second, and more direct, way involves embedding sets of formulae. This work can be applied to many of the logics developed for different kinds of reasoning, including predicate calculus, modal logics, possibilistic logics, probabilistic (...) logics and non-monotonic logics. (shrink)

Here I consider the relative merits of two recent models of explanation, James Woodward's interventionist-counterfactual model and the model model. According to the former, explanations are largely constituted by information about the consequences of counterfactual interventions. Problems arise for this approach because countless relevant interventions are possible in most cases and because it overlooks other kinds of equally relevant information. According the model model, explanations are largely constituted by cognitive models of actual mechanisms. On this approach, explanations tend not to (...) represent any of the aforementioned information explicitly but can instead be used to produce it on demand. The model model thus offers the more plausible account of the information of which we are aware when we have an explanation and of the ratiocinative process through which we derive many kinds of information that are relevant to the evaluation of explanations. (shrink)

Theories concerning the structure, or format, of mental representation should (1) be formulated in mechanistic, rather than metaphorical terms; (2) do justice to several philosophical intuitions about mental representation; and (3) explain the human capacity to predict the consequences of worldly alterations (i.e., to think before we act). The hypothesis that thinking involves the application of syntax-sensitive inference rules to syntactically structured mental representations has been said to satisfy all three conditions. An alternative hypothesis is that thinking requires the construction (...) and manipulation of the cognitive equivalent of scale models. A reading of this hypothesis is provided that satisfies condition (1) and which, even though it may not fully satisfy condition (2), turns out (in light of the frame problem) to be the only known way to satisfy condition (3). (shrink)

This paper argues that some traditional fallacies should be considered as reasonable arguments when used as part of a properly conducted dialog. It is shown that argumentation schemes, formal dialog models, and profiles of dialog are useful tools for studying properties of defeasible reasoning and fallacies. It is explained how defeasible reasoning of the most common sort can deteriorate into fallacious argumentation in some instances. Conditions are formulated that can be used as normative tools to judge whether a given defeasible (...) argument is fallacious or not. It is shown that three leading violations of proper dialog standards for defeasible reasoning necessary to see how fallacies work are: (a) improper failure to retract a commitment, (b) failure of openness to defeat, and (c) illicit reversal of burden of proof. (shrink)

The motivation of this study is that Reiter’s default theory as well as assumption-based argumentation frameworks corresponding to default theories have difficulties in handling disjunctive information, while a disjunctive default theory (ddt) avoids them. This paper presents the semantic correspondence between generalized assumption-based argumentation (ABA) and extended disjunctive logic programming as well as the correspondence between ABA and nonmonotonic reasoning approaches such as disjunctive default logic and prioritized circumscription. To overcome the above-mentioned difficulties of ABA frameworks corresponding to default theories, (...) we propose an assumption-based framework (ABF) translated from an extended disjunctive logic program (EDLP) since an EDLP can be translated into a ddt. Our ABF incorporates explicit negation and the connective of disjunction “|” to Heyninck and Arieli’s ABF induced by a disjunctive logic program. In this paper, first, we show how arguments are constructed from disjunctive rules in our proposed ABF. Then, we show the correspondence between answer sets of an EDLP P and stable extensions of the ABF translated from P with trivialization rules. After defining rationality postulates, we show answer sets of a consistent EDLP are captured by consistent stable extensions of the translated ABF with no trivialization rules. Finally, we show the correspondence between ABA and disjunctive default logic (resp. prioritized circumscription). The relation between ABA and possible model semantics of EDLPs is also discussed. (shrink)