Nonmonotonic Logic

Using Gärdenfors's notion of epistemic entrenchment, we develop the semantics of a logic which accounts for the following points. It explains why we may generally infer `If ~A then B´ if all we know is AvB while must not generally infer `If ~A then B´ if all we know is {AvB, A}. More generally, it explains the nonmonotonic nature of the consequence relation governing languages which contain conditionals, and it explains how we can deduce conditionals from premise sets without conditionals. (...) Depending on the language at hand, our logic provides different ways of keeping the Ramsey test and getting round the Gärdenfors triviality theorem. I argue that consistent additions of new items of belief are not to be performed by transitions to logical expansions. (shrink)

I present a possible worlds semantics for a hyperintensional belief revision operator, which reduces the logical idealization of cognitive agents affecting similar operators in doxastic and epistemic logics, as well as in standard AGM belief revision theory. belief states are not closed under classical logical consequence; revising by inconsistent information does not perforce lead to trivialization; and revision can be subject to ‘framing effects’: logically or necessarily equivalent contents can lead to different revisions. Such results are obtained without resorting to (...) non-classical logics, or to non-normal or impossible worlds semantics. The framework combines, instead, a standard semantics for propositional S5 with a simple mereology of contents. (shrink)

According to the Reasoning View about normative reasons, facts about normative reasons for action can be understood in terms of facts about the norms of practical reasoning. I argue that this view is subject to an overlooked class of counterexamples, familiar from debates about Subjectivist theories of normative reasons. Strikingly, the standard strategy Subjectivists have used to respond to this problem cannot be adapted to the Reasoning View. I think there is a solution to this problem, however. I argue that (...) the norms of practical reasoning, like the norms of theoretical reasoning, are characteristically defeasible, in a sense I make precise. Recognizing this property of those norms makes space for a solution to the problem. The resulting view is in a way analogous to the familiar defeasibility theory of knowledge, but it avoids a standard objection to that theory. (shrink)

This paper discusses 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 are analyzed in a nonprobabilistic 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)

Recent work has considered the problem of extending to the case of iterated belief change the so-called `Harper Identity' (HI), which defines single-shot contraction in terms of single-shot revision. The present paper considers the prospects of providing a similar extension of the Levi Identity (LI), in which the direction of definition runs the other way. We restrict our attention here to the three classic iterated revision operators--natural, restrained and lexicographic, for which we provide here the first collective characterisation in the (...) literature, under the appellation of `elementary' operators. We consider two prima facie plausible ways of extending (LI). The first proposal involves the use of the rational closure operator to offer a `reductive' account of iterated revision in terms of iterated contraction. The second, which doesn't commit to reductionism, was put forward some years ago by Nayak et al. We establish that, for elementary revision operators and under mild assumptions regarding contraction, Nayak's proposal is equivalent to a new set of postulates formalising the claim that contraction by ¬A should be considered to be a kind of `mild' revision by A. We then show that these, in turn, under slightly weaker assumptions, jointly amount to the conjunction of a pair of constraints on the extension of (HI) that were recently proposed in the literature. Finally, we consider the consequences of endorsing both suggestions and show that this would yield an identification of rational revision with natural revision. We close the paper by discussing the general prospects for defining iterated revision in terms of iterated contraction. (shrink)

The paper considers contemporary models of presumption in terms of their ability to contribute to a working theory of presumption for argumentation. Beginning with the Whatelian model, we consider its contemporary developments and alternatives, as proposed by Sidgwick, Kauffeld, Cronkhite, Rescher, Walton, Freeman, Ullmann-Margalit, and Hansen. Based on these accounts, we present a picture of presumptions characterized by their nature, function, foundation and force. On our account, presumption is a modal status that is attached to a claim and has the (...) effect of shifting, in a dialogue, a burden of proof set at a local level. Presumptions can be analysed and evaluated inferentially as components of rule-based structures. Presumptions are defeasible, and the force of a presumption is a function of its normative foundation. This picture seeks to provide a framework to guide the development of specific theories of presumption. (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)

We present a formal semantics for epistemic logic, capturing the notion of knowability relative to information (KRI). Like Dretske, we move from the platitude that what an agent can know depends on her (empirical) information. We treat operators of the form K_AB (‘B is knowable on the basis of information A’) as variably strict quantifiers over worlds with a topic- or aboutness- preservation constraint. Variable strictness models the non-monotonicity of knowledge acquisition while allowing knowledge to be intrinsically stable. Aboutness-preservation models (...) the topic-sensitivity of information, allowing us to invalidate controversial forms of epistemic closure while validating less controversial ones. Thus, unlike the standard modal framework for epistemic logic, KRI accommodates plausible approaches to the Kripke-Harman dogmatism paradox, which bear on non-monotonicity, or on topic-sensitivity. KRI also strikes a better balance between agent idealization and a non-trivial logic of knowledge ascriptions. (shrink)

In this essay, we extend earlier inferentialist-expressivist treatments of traditional logical, semantic, modal, and representational vocabulary (Brandom 1994, 2008, 2015; Peregrin 2014) to explanatory vocabulary. From this perspective, Inference to the Best Explanation (IBE) appears to be an obvious starting point. In its simplest formulation, IBE has the form: A best explains why B, B; so A. It thereby captures one of the central inferential features of explanation. An inferentialist-expressivist treatment of “best explains” would treat it as a logical operator. (...) Analogous to the inferentialist-expressivist treatment of other logical operators, this essay aims to provide introduction and elimination rules for “best explains.” Indeed, by exhibiting a form of detachment, IBE superficially looks like an elimination rule. The sequent calculus LEA+, described in Section 5 below, makes good on this intuition. By showing how “A best explains why B” is related to the underlying, scientific inference “A, so B,” we can purchase the inference ticket of IBE for no more than the cost of science’s material inferences. (shrink)

We identify two pragmatic problems in temporal reasoning, the qualification problem and the extended prediction problem, the latter subsuming the infamous frame problem. Solutions to those seem to call for nonmonotonic inferences, and yet naive use of standard nonmonotonic logics turns out to be inappropriate. Looking for an alternative, we first propose a uniform approach to constructing and understanding nonmonotonic logics. This framework subsumes many existing nonmonotonic formalisms, and yet is remarkably simple, adding almost no extra baggage to traditional logic. (...) We then use this framework to propose a solution to the qualification problem. We also outline a solution to the extended prediction problem, and speculate on a possible connection between the above discussion and the concept of causation. (shrink)

The belief base approach to belief representation and belief dynamics is developed as an alternative to the belief set approaches, which are pioneered by the AGM model. The belief base approach models collections of information and expectations of an agent as possibly incomplete and possibly inconsistent foundations for her beliefs. Nevertheless, the beliefs of an agent are always consistent; this is ensured by a sophisticated inference relation. Belief changes take place on the information base instead of on the belief set, (...) providing a reasonable account of belief change, for the content of the information base is much smaller than a closed belief set, and directly accessible by the agent for its elements are characterized as explicit and non- inferential information the agent acquires, while the closed belief set represents what the agent is committed to believe. In chapter 2, I present an investigation of the belief base approach, both its statics (formation of beliefs from an information base) and its dynamics, while presenting the consequences of the approach; as well as a brief investigation of the AGM model as the representative of the belief set approaches, to make comparisons between the two approaches. In chapter 3, I offer a modal model of the statics of the belief base approach using situation semantics. The choice of semantics is primarily due to that situation semantics can model incomplete and inconsistent collections of sentences. The belief modality offered in this model is intended to capture the inference process in the belief base approach as much as possible. (shrink)

Nearly a decade has past since Grove gave a semantics for the AGM postulates. The semantics, called sphere semantics, provided a new perspective of the area of study, and has been widely used in the context of theory or belief change. However, the soundness proof that Grove gives in his paper contains an error. In this note, we will point this out and give two ways of repairing it.

In this paper I use the distinction between hard and soft information from the dynamic epistemic logic tradition to extend prior work on informational conceptions of logic to include non-monotonic consequence-relations. In particular, I defend the claim that at least some non-monotonic logics can be understood on the basis of soft or “belief-like” logical information, and thereby question the orthodox view that all logical information is hard, “knowledge-like”, information.

In substructural logics, structural principles may hold in some fragments of a consequence relation without holding globally. I look at this phenomenon in my preferred substructural logic, in which Weakening and Cut fail but which is supra-intuitionistic. I introduce object language operators that keep track of the admissibility of Weakening and of intuitionistic implications. I end with some ideas about local transitivity.

I am presenting a sequent calculus that extends a nonmonotonic consequence relation over an atomic language to a logically complex language. The system is in line with two guiding philosophical ideas: (i) logical inferentialism and (ii) logical expressivism. The extension defined by the sequent rules is conservative. The conditional tracks the consequence relation and negation tracks incoherence. Besides the ordinary propositional connectives, the sequent calculus introduces a new kind of modal operator that marks implications that hold monotonically. Transitivity fails, but (...) for good reasons. Intuitionism and classical logic can easily be recovered from the system. (shrink)

gramming environment, BABY-SIT, which is based on situation theory. We then demonstrate how problems requir-.

We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore how probabilistic reasoning under coherence is related to model- theoretic probabilistic reasoning and to default reasoning in System . In particular, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabilistic logic with concepts from default reasoning. Moreover, we show that probabilistic reasoning under coherence is a generalization of default reasoning in System (...) . That is, we provide a new probabilistic semantics for System , which neither uses infinitesimal probabilities nor atomic bound (or big-stepped) probabilities. These results also provide new algorithms for probabilistic reasoning under coherence and for default reasoning in System , and they give new insight into default reasoning with conditional objects. (shrink)

A notion of an epistemic state is introduced as a generalization of common representations suggested for belief change. Based on it, a new kind of nonmonotonic inference relation corresponding to belief contractions is defined. A number of representation results is established that cover both traditional AGM contractions and contractions that do not satisfy recovery.

Theories of epistemic justification are commonly assessed by exploring their predictions about particular hypothetical cases – predictions as to whether justification is present or absent in this or that case. With a few exceptions, it is much less common for theories of epistemic justification to be assessed by exploring their predictions about logical principles. The exceptions are a handful of ‘closure’ principles, which have received a lot of attention, and which certain theories of justification are well known to invalidate. But (...) these closure principles are only a small sample of the logical principles that we might consider. In this paper, I will outline four further logical principles that plausibly hold for justification and two which plausibly do not. While my primary aim is just to put these principles forward, I will use them to evaluate some different approaches to justification and (tentatively) conclude that a ‘normic’ theory of justification best captures its logic. (shrink)

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

I want to model a finite, fallible cognitive agent who imagines that p in the sense of mentally representing a scenario—a configuration of objects and properties—correctly described by p. I propose to capture imagination, so understood, via variably strict world quantifiers, in a modal framework including both possible and so-called impossible worlds. The latter secure lack of classical logical closure for the relevant mental states, while the variability of strictness captures how the agent imports information from actuality in the imagined (...) non-actual scenarios. Imagination turns out to be highly hyperintensional, but not logically anarchic. Section 1 sets the stage and impossible worlds are quickly introduced in Sect. 2. Section 3 proposes to model imagination via variably strict world quantifiers. Section 4 introduces the formal semantics. Section 5 argues that imagination has a minimal mereological structure validating some logical inferences. Section 6 deals with how imagination under-determines the represented contents. Section 7 proposes additional constraints on the semantics, validating further inferences. Section 8 describes some welcome invalidities. Section 9 examines the effects of importing false beliefs into the imagined scenarios. Finally, Sect. 10 hints at possible developments of the theory in the direction of two-dimensional semantics. (shrink)

We introduce a simple generalization of Gardenfors and Makinson’s epistemic entrenchment called partial entrenchment. We show that preferential inference can be generated as the sceptical counterpart of an inference mechanism defined directly on partial entrenchment.

We examine the closure conditions of the probabilistic consequence relation of Hawthorne and Makinson, specifically the outstanding question of completeness in terms of Horn rules, of their proposed (finite) set of rules O. We show that on the contrary no such finite set of Horn rules exists, though we are able to specify an infinite set which is complete.

After a review of situation theory and previous attempts at `computational' situation theory, we present a new programming environment, BABY-SIT, which is based on situation theory. We then demonstrate how problems requiring formal temporal reasoning can be solved in this framework. Specifically, the Yale Shooting Problem, which is commonly regarded as a canonical problem for nonmonotonic temporal reasoning, is implemented in BABY-SIT using Yoav Shoham's causal theories.

The properties of monotonic inference systems and the properties of their theories are strongly linked. These links, however, are much weaker in nonmonotonic inference systems. In this paper we introduce the notion of anaxiomatic variety for a theory and show how this notion, instead of the notion of a theory, can be used for the syntactic and semantic analysis of nonmonotonic inferences.

We chart the ways in which closure properties of consequence relations for uncertain inference take on different forms according to whether the relations are generated in a quantitative or a qualitative manner. Among the main themes are: the identification of watershed conditions between probabilistically and qualitatively sound rules; failsafe and classicality transforms of qualitatively sound rules; non-Horn conditions satisfied by probabilistic consequence; representation and completeness problems; and threshold-sensitive conditions such as `preface' and `lottery' rules.

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)

In most everyday instances of reasoning, reasoners can gain, lose, and reacquire entitlement to (or justification for) a possible commitment (or belief) as a result of their consecutively acquiring new commitments. For example, we might initially conclude that ‘Tweety can fly’ from ‘Tweety is a bird,’ but later have to reject this conclusion as a result of our coming to learn that Tweety is a penguin. We could, even later, reacquire entitlement to ‘Tweety can fly’ if we became committed (and (...) presumably entitled) to the claim ‘Tweety has a jetpack.’ I will call this very common feature of reasoning entitlement recovery. In this paper I will argue that the types of inferential relations that are central to Brandom’s entire account of language and reasoning make entitlement recovery impossible. I will then briefly attempt to diagnose why this problem arises for Brandom and suggest how his account should be modified so that it will successfully allow entitlement recovery. (shrink)

One of the main tools in the study of nonmonotonic consequence relations is the representation of such relations in terms of preferential models. In this paper we give an unified and simpler framework to obtain such representation theorems.

Rational consequence relations and Popper functions provide logics for reasoning under uncertainty, the former purely qualitative, the latter probabilistic. But few researchers seem to be aware of the close connection between these two logics. I’ll show that Popper functions are probabilistic versions of rational consequence relations. I’ll not assume that the reader is familiar with either logic. I present them, and explicate the relationship between them, from the ground up. I’ll also present alternative axiomatizations for each logic, showing them to (...) depend on weaker axioms than usually recognized. (shrink)

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)

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)

In this paper we study substantive assumptions in social interaction. By substantive assumptions we mean contingent assumptions about what the players know and believe about each other’s choices and information. We first explain why substantive assumptions are fundamental for the analysis of games and, more generally, social interaction. Then we show that they can be compared formally, and that there exist contexts where no substantive assumptions are being made. Finally we show that the questions raised in this paper are related (...) to a number of issues concerning “large” structures in epistemic game theory. (shrink)

This is the introduction of the special issue,.

In previous work, we studied four well known systems of qualitative probabilistic inference, and presented data from computer simulations in an attempt to illustrate the performance of the systems. These simulations evaluated the four systems in terms of their tendency to license inference to accurate and informative conclusions, given incomplete information about a randomly selected probability distribution. In our earlier work, the procedure used in generating the unknown probability distribution (representing the true stochastic state of the world) tended to yield (...) probability distributions with moderately high entropy levels. In the present article, we present data charting the performance of the four systems when reasoning in environments of various entropy levels. The results illustrate variations in the performance of the respective reasoning systems that derive from the entropy of the environment, and allow for a more inclusive assessment of the reliability and robustness of the four systems. (shrink)

The traditional connection between logic and reasoning has been under pressure ever since Gilbert Harman attacked the received view that logic yields norms for what we should believe. In this article I first place Harman's challenge in the broader context of the dialectic between logical revisionists like Bob Meyer and sceptics about the role of logic in reasoning like Harman. I then develop a formal model based on contemporary epistemic and doxastic logic in which the relation between logic and norms (...) for belief can be captured. (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)

In this paper we provide a formal description of what it means to be in a local or partial information-state. Starting from the notion of locality in a relational structure, we define so-called adaptive gen- erated submodels. The latter are then shown to yield an adaptive logic wherein the derivability of Pφ is naturally interpreted as a core property of being in a state in which one holds the information that φ.

In their unifying theory to model uncertainty, Friedman and Halpern (1995–2003) applied plausibility measures to default reasoning satisfying certain sets of axioms. They proposed a distinctive condition for plausibility measures that characterizes “qualitative” reasoning (as contrasted with probabilistic reasoning). A similar and similarly fundamental, but more general and thus stronger condition was independently suggested in the context of “basic” entrenchment-based belief revision by Rott (1996–2003). The present paper analyzes the relation between the two approaches to formalizing basic notions of plausibility (...) as used in qualitative default reasoning. While neither approach is a special case of the other, translations can be found that elucidate their relationship. I argue that Rott’s notion of plausibility allows for a more modular set-up and has a better philosophical motivation than that of Friedman and Halpern. (shrink)

This paper combines various structures representing degrees of belief, degrees of disbelief, and degrees of non-belief (degrees of expectations) into a unified whole. The representation uses relations of comparative necessity and possibility, as well as non-probabilistic functions assigning numerical values of necessity and possibility. We define all-encompassing necessity structures which have weak expectations (mere hypotheses, guesses, conjectures, etc.) occupying the lowest ranks and very strong, ineradicable ('a priori') beliefs occupying the highest ranks. Structurally, there are no differences from the top (...) to the bottom. I argue that belief is a vague notion, and that thresholds for belief, if there are any, are context-dependent. (shrink)

This is a survey paper. Contents: 1 Introduction ― 2 Preliminary remarks on information, truth and mind - 2.1 Remarks on information and truth - 2.2 Some clues from the philosophy of mind - 2.3 Functionalism as applied to belief revision - 2.4 Filling in the parameters ― 3 Belief change = revision + reflection - 3.1 Foundationalism - 3.2 Coherentism ― 4 Inference operations for simple change operations: three examples - 4.1 Example 1: flat data bases - 4.2 Example (...) 2: up-sets in prioritized data bases - 4.3 Example 3: maximal-consistent sets in prioritized data bases ― 5 Representing coherentist belief change by operations on prioritized data bases - 5.1 Moderate revision - 5.2 Revision by comparison ― 6 A very brief history of belief revision - 6.1 The 1980s: AGM's classical model - 6.2 The 1990s: iteration - 6.3 The 2000s: merging ― 7 Conclusion. (shrink)

Change, Choice and Inference develops logical theories that are necessary both for the understanding of adaptable human reasoning and for the design of intelligent systems. The book shows that reasoning processes - the drawing on inferences and changing one's beliefs - can be viewed as belonging to the realm of practical reason by embedding logical theories into the broader context of the theory of rational choice. The book unifies lively and significant strands of research in logic, philosophy, economics and artificial (...) intelligence. It elaborates on the relevant theories and provides a mathematically precise foundation for the thesis that large parts of theoretical reason can be subsumed under practical reason. (shrink)

This paper compares three accounts of what can be inferred from a knowledge base that contains conditionals: Lehmann and Magidor’s Rational Entailment; Pearl’s System Z, later extended and refined in collaboration with Goldszmidt; and the present author’s Nonmonotonic conditional logic for belief revision. We show that although the ideas motivating these systems are strikingly different, they are formally equivalent. An explanation of the surprising parallel is offered in terms of the interpretation of conditionals in the context of nonmonotonic reasoning and (...) belief revision. Finally, some common problems with the equivalent systems are outlined, as well as some problems in assessing these problems which indicate that a general definition of dependence between the items in a knowledge base is needed. (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)