Nonmonotonic logics allow—contrary to classical (monotone) logics— for withdrawing conclusions in the light of new evidence. Nonmonotonic reasoning is often claimed to mimic human common sense reasoning. Only a few studies, though, have investigated this claim empirically. system p is a central, broadly accepted nonmonotonic reasoning system that proposes basic rationality postulates. We previously investigated empirically a probabilistic interpretation of three selected rules of system p. We found a relatively good agreement of human reasoning and principles of nonmonotonic reasoning according (...) to the coherence interpretation of system p. This study reports an experiment on the cautious monotonicity Rule and its “incautious” counterpart that is not contained in system p, namely the monotonicity Rule. In accordance with our previous results, the data suggest that people reason nonmonotonically: the subjects in the cautious monotonicity condition infer significantly tighter intervals close to the coherence interpretation of system p compared with the subjects in the incautious monotonicity condition where rather wide (and hence non-informative) intervals are inferred. (shrink)

It seems that nonmonotonicity of our reasoning is an obvious truth. Almost every logician not even believes, but simply knows very well that a human being thinks in a nonmonotonic way. Moreover, a nonmonotonicity of thinking seems to be a phenomenon parallel to the existence of human beings. Examples allegedly illustrating this phenomenon are not even analyzed today. They are simply quoted. Nowadays, this is a standard approach to nonmonotonicity. However, even simple analysis of those “obvious” examples (...) shows that they illustrate various problems of our thinking, among which none concerns nonmonotonicity. (shrink)

Motivated by semantic inferentialism and logical expressivism proposed by Robert Brandom, in this paper, I submit a nonmonotonic modal relevant sequent calculus equipped with special operators, □ and R. The base level of this calculus consists of two different types of atomic axioms: material and relevant. The material base contains, along with all the flat atomic sequents (e.g., Γ0, p |~0 p), some non-flat, defeasible atomic sequents (e.g., Γ0, p |~0 q); whereas the relevant base consists of the local region (...) of such a material base that is sensitive to relevance. The rules of the calculus uniquely and conservatively extend these two types of nonmonotonic bases into logically complex material/relevant consequence relations and incoherence properties, while preserving Containment in the material base and Reflexivity in the relevant base. The material extension is supra-intuitionistic, whereas the relevant extension is stronger than a logic slightly weaker than R. The relevant extension also avoids the fallacies of relevance. Although the extended material consequence relation is defeasible and insensitive to relevance, it has local regions of indefeasibility and relevance (the latter of which is marked by the relevant extension). The newly introduced operators, □ and R, codify these local regions within the same extended material consequence relation. (shrink)

Nonmonotonic reasoning is often claimed to mimic human common sense reasoning. Only a few studies, though, have investigated this claim empirically. We report four experiments which investigate three rules of SYSTEMP, namely the AND, the LEFT LOGICAL EQUIVALENCE, and the OR rule. The actual inferences of the subjects are compared with the coherent normative upper and lower probability bounds derived from a non-infinitesimal probability semantics of SYSTEM P. We found a relatively good agreement of human reasoning and principles of nonmonotonic (...) reasoning. Contrary to the results reported in the ‘heuristics and biases’ tradition, the subjects committed relatively few upper bound violations (conjunction fallacies). (shrink)

Three studies of human nonmonotonic reasoning are described. The results show that people find such reasoning quite difficult, although being given problems with known subclass-superclass relationships is helpful. The results also show that recognizing differences in the logical strengths of arguments is important for the nonmonotonic problems studied. For some of these problems, specificity – which is traditionally considered paramount in drawing appropriate conclusions – was irrelevant and so should have lead to a “can’t tell” response; however, people could give (...) rational conclusions based on differences in the logical consequences of arguments. The same strategy also works for problems where specificity is relevant, suggesting that in fact specificity is not paramount. Finally, results showed that subjects’ success at responding appropriately to nonmonotonic problems involving conflict relies heavily on the ability to appreciate differences in the logical strength of simple, non-conflicting, statements. (shrink)

The aim of the present paper is to analyse compactness properties of nonmonotonic inference operations within the framework of model theory. For this purpose the concepts of a deductive frame and its semantical counterpart, a semantical frame are introduced. Compactness properties play a fundamental in the study of non-monotonic inference, and in the paper several new versions of compactness are studied.

Conclusions reached using common sense reasoning from a set of premises are often subsequently revised when additional premises are added. Because we do not always accept previous conclusions in light of subsequent information, common sense reasoning is said to be nonmonotonic. But in the standard formal systems usually studied by logicians, if a conclusion follows from a set of premises, that same conclusion still follows no matter how the premise set is augmented; that is, the consequence relations of standard logics (...) are monotonic. Much recent research in AI has been devoted to the attempt to develop nonmonotonic logics. After some motivational material, we give four formal proofs that there can be no nonmonotonic consequence relation that is characterized by universal constraints on rational belief structures. In other words, a nonmonotonic consequence relation that corresponds to universal principles of rational belief is impossible. We show that the nonmonotonicity of common sense reasoning is a function of the way we use logic, not a function of the logic we use. We give several examples of how nonmonotonic reasoning systems may be based on monotonic logics. (shrink)

Nonmonotonic reasoning is often claimed to mimic human common sense reasoning. Only a few studies, though, investigated this claim empirically. In the present paper four psychological experiments are reported, that investigate three rules of system p, namely the and, the left logical equivalence, and the or rule. The actual inferences of the subjects are compared with the coherent normative upper and lower probability bounds derived from a non-infinitesimal probability semantics of system p. We found a relatively good agreement of human (...) reasoning and principles of nonmonotonic reasoning according to the coherence interpretation of system p. Contrary to the results reported in the “heuristics and biases” tradition, the subjects committed relatively few upper bound violations (conjunction fallacies). More lower than upper bound violations were observed. When the premises were presented in terms of intervals higher mean lower bounds were observed as when the premises were presented in terms of point percentages. (shrink)

There is a gap between two different modes of computation: the symbolic mode and the subsymbolic (neuron-like) mode. The aim of this paper is to overcome this gap by viewing symbolism as a high-level description of the properties of (a class of) neural networks. Combining methods of algebraic semantics and non-monotonic logic, the possibility of integrating both modes of viewing cognition is demonstrated. The main results are (a) that certain activities of connectionist networks can be interpreted as non-monotonic inferences, and (...) (b) that there is a strict correspondence between the coding of knowledge in Hopfield networks and the knowledge representation in weight-annotated Poole systems. These results show the usefulness of non-monotonic logic as a descriptive and analytic tool for analyzing emerging properties of connectionist networks. Assuming an exponential development of the weight function, the present account relates to optimality theory – a general framework that aims to integrate insights from symbolism and connectionism. The paper concludes with some speculations about extending the present ideas. (shrink)

This paper is an attempt to bring together two separated areas of research: classical mathematics and metamathematics on the one side, non-monotonic reasoning on the other. This is done by simulating nonmonotonic logic through antitonic theory extensions. In the first half, the specific extension procedure proposed here is motivated informally, partly in comparison with some well-known non-monotonic formalisms. Operators V and, more generally, U are obtained which have some plausibility when viewed as giving nonmonotonic theory extensions. In the second half, (...) these operators are treated from a mathematical and metamathematical point of view. Here an important role is played by U -closed theories and U -fixed points. The last section contains results on V-closed theories which are specific for V. (shrink)

ABSTRACT What characterizes human reasoning is the ability of dealing with incomplete information. Incomplete logic is developed for modeling incomplete knowledge. The most distinctive feature of incomplete logic is its semantics. This is an alternative presentation of partial semantics. In this paper, we will introduce the general notion of incomplete logic (ICL), compare it with partial logic, and give the resolution method for it. We will also show how ICL can be applied to nonmonotonic reasoning. We define nonmonotonic derivation as (...) monotonic derivation in ICL from the database and some consistent assumptions. The mechanism of ICL makes it easy to assert the consistency of an assumption without asserting the assumption itself. (shrink)

This paper has two goals. First, we develop frameworks for logical systems which are able to reflect not only non-monotonic patterns of reasoning, but also paraconsistent reasoning. Our second goal is to have a better understanding of the conditions that a useful relation for nonmonotonic reasoning should satisfy. For this we consider a sequence of generalizations of the pioneering works of Gabbay, Kraus, Lehmann, Magidor and Makinson. These generalizations allow the use of monotonic nonclassical logics as the underlying logic upon (...) which nonmonotonic reasoning may be based. Our sequence of frameworks culminates in what we call plausible, nonmonotonic, multiple-conclusion consequences relations . Our study yields intuitive justifications for conditions that have been proposed in previous frameworks and also clarifies the connections among some of these systems. In addition, we present a general method for constructing plausible nonmonotonic relations. This method is based on a multiple-valued semantics, and on Shoham's idea of preferential models. (shrink)

In this essay I enter into a recently published debate between Stephen Schiffer and Jerry Fodor concerning whether adequate sense can be made of the ceteris paribus conditions in special science laws, much of their focus being on the case of putative psychological laws. Schiffer argues that adequate sense cannot be made of ceteris paribus clauses, while Fodor attempts to overcome Schiffer's arguments, in defense of special science laws. More recently, Peter Mott has attempted to show that Fodor's response to (...) Schiffer fails, and furthermore that further study shows that the logical framework in which Schiffer and Fodor address their issue is susceptible to inconsistency.In this essay I argue that adequate sense can be made of ceteris paribus conditions. Against Mott, I argue that recent work in the model theory of non-monotonic logic indicates how his problem involving logical inconsistencies can be overcome. Against Schiffer, I argue that the claims that he makes against ceteris paribus clauses would lead to a fatal skepticism concerning indefinitely many of the claims we make about the world (and indeed that his claims would be destructive of the view of the special sciences that Schiffer himself presents in his paper), and that the semantical considerations from non-monotonic logic that I present provide a suitable framework for dealing with his complaints. Thus I come out on the whole on Fodor's side of this debate, although for my own reasons, as I argue against much of Fodor's own argumentation. (shrink)

ABSTRACT Two levels of description of nonmonotonic reasoning are distinguished. For these levels semantical formalizations are given. The first level is defined semantically by the notion of belief state frame, the second level by the notion of reasoning frame. We introduce two specification languages to describe nonmonotonic reasoning at each of the levels: a specification language for level 1, with formal semantics based on belief state frames, a fragment of infinitary temporal logic as a general specification language for level 2, (...) with formal semantics based on reasoning frames. In our framework every level 2 description can be abstracted to level 1, and for every level 1 description there are level 2 descriptions which are a specialization of it. (shrink)

This paper presents a uniform semantic treatment of nonmonotonic inference operations that allow for inferences from infinite sets of premises. The semantics is formulated in terms of selection functions and is a generalization of the preferential semantics of Shoham (1987), (1988), Kraus, Lehman, and Magidor (1990) and Makinson (1989), (1993). A selection function picks out from a given set of possible states (worlds, situations, models) a subset consisting of those states that are, in some sense, the most preferred ones. A (...) proposition α is a nonmonotonic consequence of a set of propositions Γ iff α holds in all the most preferred Γ-states. In the literature on revealed preference theory, there are a number of well-known theorems concerning the representability of selection functions, satisfying certain properties, in terms of underlying preference relations. Such theorems are utilized here to give corresponding representation theorems for nonmonotonic inference operations. At the end of the paper, the connection between nonmonotonic inference and belief revision, in the sense of Alchourrón, Gärdenfors, and Makinson, is explored. In this connection, infinitary belief revision operations that allow for the revision of a theory with a possibly infinite set of propositions are introduced and characterized axiomatically. (shrink)

Reasoning with conditionals is often thought to be non-monotonic, but there is no incompatibility with classical logic, and no need to formalise inference itself as probabilistic. When the addition of a new premise leads to abandonment of a previously compelling conclusion reached by modus ponens, for example, this is generally because it is hard to think of a model in which the conditional and the new premise are true.

A few years ago, believing that human thinking is nonmonotonic, I tried to reconstruct a nonmonotonic reasoning by application of two monotonic procedures. I called them “step forward” and “step backward” . The first procedure is just a consequence operation responsible for an extension of the set of beliefs. The second one, defined on the base of the logic of falsehood reconstructed for the given logic of truthfulness, is responsible for a reduction of the set of beliefs. Both procedures taken (...) together were successfully verified by using so-called AGM , postulates for expansion, contraction and revision formulated by Alchourrón, Gärdenfors and Makinson . Reasoning composed of the mutual application of both procedures seemed to be quite natural for modeling our thinking. At that time, I supposed that it should be nonmonotonic but I was wrong. It turned out impossible to satisfy a definition of the nonmonotonic inference by reasoning composed both steps. To understand why this is impossible, I began to analyze how nonmonotonicity is obtainable in some well-known cases in the literature. I analyzed the problem from two points of view: non-formal examples for nonmonotonicity and formal constructions of nonmonotonic operations/relations. The result of those investigations was astonishing: none of the considered by me cases of nonmonotonicity belonging to point and almost none belonging to satisfies the definition of nonmonotonic inference. Arguments against the nonmonotonic character of well-known examples for nonmonotonicity of human thinking are more precisely presented in [6]. I present them below an abbreviated version of them. (shrink)

: Claus Oetke, in his "Ancient Indian Logic as a Theory of Non-monotonic Reasoning," presents a sweeping new interpretation of the early history of Indian logic. His main proposal is that Indian logic up until Dharmakirti was nonmonotonic in character-similar to some of the newer logics that have been explored in the field of Artificial Intelligence, such as default logic, which abandon deductive validity as a requirement for formally acceptable arguments; Dharmakirti, he suggests, was the first to consider that a (...) good argument should be one for which it is not possible for the property identified as the "reason" (hetu) to occur without the property to be proved (sadhya)-a requirement akin to deductive validity. Oetke's approach is challenged here, arguing that from the very beginning in India something like monotonic, that is, deductively valid, reasoning was the ideal or norm, but that the conception of that ideal was continually refined, in that the criteria for determining when it is realized were progressively sharpened. (shrink)

Normic laws have the form "if A, then normally B". This paper attempts to show that if a philosophical analysis of normic laws (1, 4) is combined with certain developments in nonmono- tonic logic (2, 3), the following problems in philosophy of science can be seen in a new pers- pective which, at least in many cases, allows to improve their received analysis: explanation and individual case understanding in the humanities (1, 2), an evolution-theoretic foundation of normic laws which explains (...) their omnipresence and establishes a the connection between prototypi- cal and statstical normality, (¤4), ceteris paribus laws (¤5), differences between physical versus non-physical sciences (¤6) and finally, theory-protection through auxiliary hypotheses (¤7). (shrink)

Induction, conceived as the class of rational non-truth preserving inferences, has been a perennial problem in philosophy. Aside from the problem of justification of induction, a less debated issue is the problem of properly describing inductive inferences. The purpose of this book is to conceptually investigate this descriptive problem of induction from the standpoint of the nonmonotonic logical tradition raised inside the field of Artificial Intelligence in the last thirty years. As we try to show, an essential part of this (...) enterprise involves the analysis of a pragmatically oriented notion of probability, called by us inductive plausibility. This in turn is made from the viewpoint of paraconsistency ? which according to some is the unavoidable companion of nonmonotonicity ? and modal logic. We therefore put forward a nonmonotonic, paraconsistent and modal approach to induction and plausibility. The book shall be useful to philosophers, logicians and computer scientists interested in the problem of induction in general and in the logical analysis of induction and plausibility in particular. (shrink)

Logics are like shadows on a wall; to understand why they dance as they do, and how they can be made to move differently, one needs to look at the mathematical structures from which they can be projected. That is a methodology that has long proven its value for classical and other forms of deductive inference; this book manifests its pertinence to logics of uncertain qualitative reasoning. It draws together and refines work from the literature on preferential and other quite (...) different semantics for such reasoning and then, in its central chapter, integrates the leading ideas from them into a single multi-dimensional semantics. It enters new territory with investigations of interpolation and qualitative independence in non-monotonic contexts as well as connections between non-monotonic logic and neuroscience, specifically with Edelman's theory of organization of the brain. Finally, it proposes novel applications such as equational modellings for contrary-to-duty normative reasoning and mathematical analyses of some kinds of casuistic reasoning in the Talmudic tradition. Profusely signposted at every turn, the volume is accessible to readers equipped with a modicum of set theory and abstract algebra. Visitors to the area can come in by the front gate and work their way, in various orders, through as much of the garden as strikes their fancy; specialists will enter at Chap. 11 or at whatever special topic interests them, well assured that they can easily backtrack to whatever bits and pieces are needed from what they skipped. A volume with a clear vision, a book to return to many times." (David Makinson). (shrink)

We show that Gabbay’s nonmonotonic consequence relations c an be reduced to a new family of relations, called entrenchment relations. Entrenchment relations provide a direct generalization of epistemic entrenchment and expectation ordering introduced by G ̈ardenfors and Makinson for the study of belief revision and expectation inference, respectively.

Recent experiments have shown that naive speakers find borderline contradictions involving vague predicates acceptable. In Cobreros et al. we proposed a pragmatic explanation of the acceptability of borderline contradictions, building on a three-valued semantics. In a reply, Alxatib et al. show, however, that the pragmatic account predicts the wrong interpretations for some examples involving disjunction, and propose as a remedy a semantic analysis instead, based on fuzzy logic. In this paper we provide an explicit global pragmatic interpretation rule, based on (...) a somewhat richer semantics, and show that with its help the problem can be overcome in pragmatics after all. Furthermore, we use this pragmatic interpretation rule to define a new consequence-relation and discuss some of its properties. (shrink)

This dissertation develops, justifies, and examines the jurisprudential implications of a non-monotonic theory of common law legal reasoning. Legal rules seem to have exceptions but identifying all of them is difficult. This hinders attempts to formalize legal rules using classical logics. Non-monotonic logics allow defeasible inference, permitting rules that hold generally but can be defeated in the presence of exceptions. This ameliorates the problem of characterizing all exceptions to a rule, because exceptions can be added piecemeal while the rule remains. (...) The first portion of the dissertation rebuts a prominent criticism leveled at a large class of theories of legal reasoning that includes my theory. The charge is that no coherent theory can recognize both the difference between distinguishing and overruling, and the constraint of precedent. The critics argue that is more important than and that can only be explained by monotonic legal rules. Drawing on cognitive psychology as well as legal theory, I show that coherent theories, such as my own, can accommodate both and. The second chapter provides motivation for understanding precedential constraint in terms of non-monotonic default rules and introduces my positive theory, which elaborates on John Horty's work in treating legal rules as prioritized defaults involving reasons. I motivate and implement a relaxation of Horty's restrictions on the form of rules to allow a more fine-grained characterization of precedent. Finally, I explore the relationship between these relaxations and the concept of precedent. The final section explains how my theory fits into the traditional jurisprudential ecosystem. I demonstrate that, contrary to assertions in the legal theory literature, this non-monotonic approach is entirely compatible with positivism's commitment to extracting rules from authoritative legal sources, namely court opinions. I also suggest how it might be attractive to law and economics theorists, pragmatists, and followers of Dworkin. (shrink)

In most logical systems, inferences cannot be invalidated simply by the addition of new premises. If an inference can be drawn from a set of premises S, then it can also be drawn from any larger set incorporrating S. The truth of the original premises guarantees the truth of the inferred conclusion, and the addition of extra premises cannot undermine it. This property is known as monotonicity. Nonmonotonic inference lacks this property. The conclusions drawn are provisional, and new information may (...) lead to the withdrawal of a previous conclusion, even though none of the original premises is retracted. (shrink)

The First International Workshop brings together researchers from the theoretical ends of the logic programming and artificial intelligence communities to discuss their mutual interests. Logic programming deals with the use of models of mathematical logic as a way of programming computers, where theoretical AI deals with abstract issues in modeling and representing human knowledge and beliefs. One common ground is nonmonotonic reasoning, a family of logics that includes room for the kinds of variations that can be found in human reasoning. (...) Topics covered: Stable Semantics. Default Logic. AutoEpistemic Logic. Truth Maintenance Systems. Implementation Issues. Diagnosis. Applications. Inheritance Reasoning. Logics of Belief. Inconsistency and Non-Monotonicity. (shrink)

Most nonmonotonic logics are assumed to be cumulative, which is often regarded as the minimum requirement for a logic. We argue that cumulativity, in particular, cumulative transitivity can be abandoned, in order to better characterize reasoning in uncertainty. But giving up cumulative transitivity makes it hard to obtain representation results for these logics. Borrowing the idea from strict-tolerant logics, we give some representation results for nonmonotonic logics that are not cumulatively transitive.

This paper reports on an approach to model generalized implicatures using nonmonotonic logics. The approach, called compositional, is based on the idea of compositional semantics, where the implicatures carried by a sentence are constructed from the implicatures carried by its constituents, but it also includes some aspects nonmonotonic logics in order to model the defeasibility of generalized implicatures.

Peter Gärdenfors has proved (Philosophical Review, 1986) that the Ramsey rule and the methodologically conservative Preservation principle are incompatible given innocuous-looking background assumptions about belief revision. Gärdenfors gives up the Ramsey rule; I argue for preserving the Ramsey rule and interpret Gärdenfors's theorem as showing that no rational belief-reviser can avoid reasoning nonmonotonically. I argue against the Preservation principle and show that counterexamples to it always involve nonmonotonic reasoning. I then construct a new formal model of belief revision that does (...) accommodate nonmonotonic reasoning. (shrink)

The logical formalism of abductive reasoning is still an open discussion and various theories have been presented about it. Abduction is a type of non-monotonic and defeasible reasonings, and the logic containing such a reasoning is one of the types of non-nonmonotonic and defeasible logics, such as inductive logic. Abduction is a kind of natural reasoning and it is a solution to the problems having this form "the phenomenon of φ cannot be explained by the theory of Θ" and we (...) need to search for (or to adduce) an explanation for φ. Taking α as the explanation and <Θ,φ> as the abductive problem, Θ∪{α}⊨φ is the logical format of a strong abductive reasoning. In this article, the proof theory for first-order abductive calculus is proposed based on Gentzen-type first-order proof theory. Considering its dual, i.e., the semantic tableaux, and without the need to translate the formulas, this calculation is sound and complete. After examining the structural rules of this calculus, some metalogical considerations and open problems such as consistency, completeness and undecidability of this account have been addressed. (shrink)

We examine the notion of conditionals and the role of conditionals in inductive logics and arguments. We identify three mistakes commonly made in the study of, or motivation for, non-classical logics. A nonmonotonic consequence relation based on evidential probability is formulated. With respect to this acceptance relation some rules of inference of System P are unsound, and we propose refinements that hold in our framework.

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)

A non-monotonic logic is a formal calculus where the consequence relation is not monotonic. Intuitively, nonmonotonicity of the consequence relation indicates that obtaining a new piece of information can reduce the set of the accepted sentences. In particular, it allows us to draw conclusions on the basis of „the lack of evidence to the contrary”. The purpose of the paper is to present the basic notions of non-monotonic logic, which will be needed in two papers in this volume.

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 generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of n conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional random quantities. We define the notion of negation, by verifying De Morgan’s Laws. We also show that conjunction and disjunction satisfy the associative and commutative properties, and a monotonicity property. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals; in particular (...) we examine the Fréchet-Hoeffding bounds. Moreover, we study the reverse probabilistic inference from the conjunction Cn+1 of n + 1 conditional events to the family {Cn,En+1|Hn+1}. We consider the relation with the notion of quasi-conjunction and we examine in detail the coherence of the prevision assessments related with the conjunction of three conditional events. Based on conjunction, we also give a characterization of p-consistency and of p-entailment, with applications to several inference rules in probabilistic nonmonotonic reasoning. Finally, we examine some non p-valid inference rules; then, we illustrate by an example two methods which allow to suitably modify non p-valid inference rules in order to get inferences which are p-valid. (shrink)

This thesis analyzes from a philosophical perspective different models for nonmonotonic inference, belief revision and the handling of inconsistencies. ;The first chapter serves as an introduction to the subject, giving examples and analyzing the main concepts. As a result of these discussions, this thesis tries to: produce a refined map of the main notions related to this subject, maintain that there can be a fault tolerant logic that stands in support of fault tolerant reasoning, and defend the use of deductive (...) databases as models for changes of belief. ;The second chapter explores monotonic proposals to deal with uncertain reasoning. These include logics based on a classical notion of consequence, interpretations of defeasible reasoning as containing implicit premises, and systems in which temporal change is an integral part of the representation of states of affairs, via temporal indices or more elaborate devices. ;The third chapter explores quantitative approaches to nonmonotonic reasoning like dispositional logic, and theories of probabilistic reasoning including Bayesian, certainty factors, and Dempster-Shafer. ;The fourth chapter explores qualitative approaches. Here we mention conditional, default, and nonmonotonic logics, and the circumscription and autoepistemic formalisms. ;The fifth chapter studies different proposals to deal with contradictions. It starts with a review of the types of belief inconsistencies, and then it presents mechanisms to prevent, control or correct them. I explore paraconsistent logics, specially relevance logics, to "bracket" the area of conflict and allow inferences about non-related topics to continue unaffected. Then I examine different methods to get rid of the inconsistencies, including the use of dependency-directed backtracking and of relevance logic. ;Finally, I present my conclusions, and mention some of the open problems. (shrink)

Lou Goble proposed powerful conditional deontic logics (CDPM) that are able to deal with deontic conflicts by means of restricting the inheritance principle. One of the central problems for dyadic deontic logics is to properly treat the restricted applicability of the principle “strengthening the antecedent”. In most cases it is desirable to derive from an obligation A under condition B, that A is also obliged under condition B and C. However, there are important counterexamples. Goble proposed a weakened rational monotonicity (...) principle to tackle this problem. This solution is suboptimal as it is for some examples counter-intuitive or even leads to explosion. The paper identifies also other problems of Goble’s systems. For instance, to make optimal use of the restricted inheritance principle, in many cases the user has to manually add certain statements to the premises. An adaptive logic framework based on CDPM is proposed which is able to tackle these problems. It allows for certain rules to be applied as much as possible. In this way counter-intuitive consequences as well as explosion can be prohibited and no user interference is required. Furthermore, for non-conflicting premise sets the adaptive logics are equivalent to Goble’s dyadic version of standard deontic logic. (shrink)

We generalize Ripley’s results on the transitivity of consequence relation, without assuming a logic to be monotonic. Following Gabbay, we assume nonmonotonic consequence relation to be inclusive and cautious monotonic, and figure out the implications between different forms of transitivity of logical consequence. Weaker frameworks without inclusiveness or cautious monotonicity are also discussed. The paper may provide basis for the study of both non-transitive logics and nonmonotonic ones.

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)

Default reasoning occurs when the available information does not deductively guarantee the truth of the conclusion; and the conclusion is nonetheless correctly arrived at. The formalisms that have been developed in Artificial Intelligence to capture this mode of reasoning have suffered from a lack of agreement as to which non-monotonic inferences should be considered correct; and so Lifschitz 1989 produced a set of “Nonmonotonic Benchmark Problems” which all future formalisms are supposed to honor. The present work investigates the extent to (...) which humans follow the prescriptions set out in these Benchmark Problems. (shrink)

Nonmonotonic causal logic is a knowledge representation language designed for describing domains that involve actions and change. The process of literal completion, similar to program completion familiar from the theory of logic programming, can be used to translate some nonmonotonic causal theories into classical logic. Its applicability is restricted, however, to theories that deal with truth-valued fluents, represented by predicate symbols. In this note we introduce functional completion—a more general process that can be applied to causal theories in which fluents (...) are treated as functions. (shrink)

Contents: PART 1. MODELS IN SCIENTIFIC PROCESSES. Joseph AGASSI: Why there is no theory of models. Ma??l??gorzata CZARNOCKA: Models and symbolic nature of knowledge. Adam GROBLER: The representational and the non-representational in models of scientific theories. Stephan HARTMANN: Models as a tool for the theory construction; some strategies of preliminary physics. William HERFEL: Nonlinear dynamical models as concrete construction. Elzbieta KA??L??USZY??N??SKA: Styles of thinking. Stathis PSILLOS: The cognitive interplay between theories and models: the case of 19th century optics. PART 2. (...) TOOLS OF SCIENCE. Nancy D. CARTWRIGHT, Towfic SHOMAR, Maricio SUAREZ: The tool-box of science. Javier ECHEVERRIA: The four contexts of scientific activity. Katline HAVAS: Continuity and change; kinds of negation in scientific progress. Matthias KAISER: The independence of scientific phenomena. W??l??adys??l??aw KRAJEWSKI: Scientific meta-philosophy. Ilkka NIINILUOTO: The emergence if scientific specialities: six models. Leszek NOWAK: Antirealism, realism and idealization. Rinat M. NUGAYEV: Classic, modern and postmodern scientific unification. Veikko RANTALA: Translation and scientific change. Gerhard SCHURZ: Theories and their applications - a case of nonmonotonic reasoning. Witold STRAWI??N??SKI: The unity of science today. Vardan TOROSIAN: Are the ethic and logic of science compatible. PART 3. UNSHARP APPROACHES IN SCIENCE. Ernest W. ADAMS: Problems and prospects in a theory of inexact first-order theories. Wolfgang BALZER and Gerhard ZOUBEK: On the comparison of approximative empirical claims. Gianpierro CATTANEO, Maria Luisa DALLA CHIARA, Roberto GIUNTINI: The unsharp approaches to quantum theory. Theo A.F. KUIPERS: Falsification versus efficient truth approximation. Bernhard LAUTH: Limiting decidability and probability. Jaros??l??aw PYKACZ: Many-valued logics in foundations of quantum mechanics. Roman R. ZAPATRIN: Logico-algebraic approach to spacetime quantization. (shrink)

We provide a general framework for constructing natural consequence relations for paraconsistent and plausible nonmonotonic reasoning. The framework is based on preferential systems whose preferences are based on the satisfaction of formulas in models. We show that these natural preferential In the research on paraconsistency, preferential systems systems that were originally designed for for paraconsistent reasoning fulfill a key condition (stopperedness or smoothness) from the theoretical research of nonmonotonic reasoning. Consequently, the nonmonotonic consequence relations that they induce fulfill the desired (...) conditions of plausible consequence relations. Hence our framework encompasses different types of preferential systems that were developed from different motivations of paraconsistent reasoning and non-monotonic reasoning, and reveals an important link between them. (shrink)

Probabilities are important in belief updating, but probabilistic reasoning does not subsume everything else (as the Bayesian would have it). On the contrary, Bayesian reasoning presupposes knowledge that cannot itself be obtained by Bayesian reasoning, making generic Bayesianism an incoherent theory of belief updating. Instead, it is indefinite probabilities that are of principal importance in belief updating. Knowledge of such indefinite probabilities is obtained by some form of statistical induction, and inferences to non-probabilistic conclusions are carried out in accordance with (...) the statistical syllogism. Such inferences have been the focus of much attention in the nonmonotonic reasoning literature, but the logical complexity of such inference has not been adequately appreciated. (shrink)

According to Brandom’s conceptual role semantics, to grasp a concept involves a commitment to drawing certain inferences. This is a consequence of the inferentialist thesis that the meaning of a term is given by its justification through assertibility conditions. Inferential commitments come out from a material notion of inference which underwrites human rational discourse and activity. In this paper I discuss a problem of Brandom’s semantics allegedly exposed in an argument by Paul Boghossian against Dummett’s and Brandom’s substantive conception of (...) meaning. I contend that Boghossian’s analysis is dubious because it overlooks an important difference between Dummett’s and Brandom’s positions related respectively to a monotonic and a non-monotonic view of the norm underwriting meaning. (shrink)

Neste trabalho, é apresentada uma investigação do que poderia ser chamado de formalização lógica do processo de mudança de teorias devido a anomalias. Por anomalia entende-se um fato observado que faz parte do escopo explanatório de uma teoria, mas que vai de encontro à previsão da mesma. Uma abordagem clássica para restaurar o poder explicativo de uma teoria ameaçada por uma anomalia é a postulação de hipóteses novas e provisórias que, em conjunto com as demais hipóteses auxiliares originais, sejam capazes (...) de resolver a anomalia. Após chegar à algumas conclusões sobre a estrutura de tal processo, propomos um framework lógico multimodal e não-monotônico capaz de representar alguns aspectos-chave dessa faceta importante da dinâmica de teorias científicas. Devido à necessidade de acomodar hipóteses provisórias incompatíveis, esse framework incorpora uma forma fraca de paraconsistência. Como um estudo de caso, analisamos o comportamento anômalo do planeta Urano que ameaçou a mecânica celeste Newtoniana por mais de meio século e ensejou a descoberta do planeta Netuno. -/- In this work, an investigation of what could be called the logical formalization of the theory change process due to anomalies is presented. An anomaly is understood as an observed fact that is part of the explanatory scope of a theory, but that goes against its prediction. A classic approach to restoring the explanatory power of a theory threatened by an anomaly is to postulate new and provisional hypotheses that, together with the other original auxiliary hypotheses, are capable of resolving the anomaly. After reaching some conclusions about the structure of such a process, we propose a multimodal and non-monotonic logical framework capable of representing some key aspects of this important facet of the dynamics of scientific theories. Due to the need to accommodate incompatible provisional hypotheses, this framework incorporates a weak form of paraconsistency. As a case study, we analyze the anomalous behavior of the planet Uranus that threatened Newtonian celestial mechanics for more than half a century and prompted the discovery of the planet Neptune. (shrink)

Since the earliest formalisation of default logic by Reiter many contributions to this appealing approach to nonmonotonic reasoning have been given. The different formalisations are here presented in a general framework that gathers the basic notions, concepts and constructions underlying default logic. Our view is to interpret defaults as special rules that impose a restriction on the juxtaposition of monotonic Hubert-style proofs of a given logicL. We propose to describe default logic as a logic where the juxtaposition of default proofs (...) is subordinate to a restriction condition . Hence a default logic is a pair (L, ) where properties of the logic , like compactness, can be interpreted through the restriction condition . Different default systems are then given a common characterization through a specific condition on the logicL. We also prove cumulativity for any default logic (L, ) by slightly modifying the notion of default proof. We extend, in fact, the language ofL in a way close to that followed by Brewka in the formulation of his cumulative default system. Finally we show the existence of infinitely many intermediary default logics, depending on and called linear logics, which lie between Reiter's and ukaszewicz' versions of default logic. (shrink)