Two systems of belief change based on paraconsistent logics are introduced in this article by means of AGM-like postulates. The first one, AGMp, is defined over any paraconsistent logic which extends classical logic such that the law of excluded middle holds w.r.t. the paraconsistent negation. The second one, AGMo , is specifically designed for paraconsistent logics known as Logics of Formal Inconsistency (LFIs), which have a formal consistency operator that allows to recover all the classical inferences. Besides the three usual (...) operations over belief sets, namely expansion, contraction and revision (which is obtained from contraction by the Levi identity), the underlying paraconsistent logic allows us to define additional operations involving (non-explosive) contradictions. Thus, it is defined external revision (which is obtained from contraction by the reverse Levi identity), consolidation and semi-revision, all of them over belief sets. It is worth noting that the latter operations, introduced by S. Hansson, involve the temporary acceptance of contradictory beliefs, and so they were originally defined only for belief bases. Unlike to previous proposals in the literature, only defined for specific paraconsistent logics, the present approach can be applied to a general class of paraconsistent logics which are supraclassical, thus preserving the spirit of AGM. Moreover, representation theorems w.r.t. constructions based on selection functions are obtained for all the operations. (shrink)

The problem of how to accommodate inconsistencies has attracted quite a number of researchers, in particular, in the area of database theory. The problem is also of concern in the study of belief change. For inconsistent beliefs are ubiquitous. However, comparatively little work has been devoted to discussing the problem in the literature of belief change. In this paper, I examine how adequate the AGM theory is as a logical framework for belief change involving inconsistencies. The technique is to apply (...) to Grove’s sphere system, a semantical representation of the AGM theory, logics that do not infer everything from contradictory premises, viz., paraconsistent logics. I use three paraconsistent logics and discuss three sphere systems that are based on them. I then examine the completeness of the postulates of the AGM theory with respect to the systems. At the end, I discuss some philosophical implications of the examination. (shrink)

Belief revision theory studies how an ideal doxastic agent should revise her beliefs when she receives new information. In part I I will first present the AGM theory of belief revision (Alchourrón & Gärdenfors & Makinson 1985). Then I will focus on the problem of iterated belief revisions.

In a recent article, Peter Gärdenfors (1992) has suggested that the AGM (Alchourrón, Gärdenfors, and Makinson) theory of belief revision can be given an epistemic basis by interpreting the revision postulates of that theory in terms of a version of the coherence theory of justification. To accomplish this goal Gärdenfors suggests that the AGM revision postulates concerning the conservative nature of belief revision can be interpreted in terms of a concept of epistemic entrenchment and that there are good empirical reasons (...) to adopt this view as opposed to some form of foundationalist account of the justification of our beliefs. In this paper I argue that Gärdenfors’ attempt to underwrite the AGM theory of belief revision by appealing to a form of coherentism is seriously inadequate for several reasons. (shrink)

This article provides a discussion of the principle of transmission of evidential support across entailment from the perspective of belief revision theory in the AGM tradition. After outlining and briefly defending a small number of basic principles of belief change, which include a number of belief contraction analogues of the Darwiche-Pearl postulates for iterated revision, a proposal is then made concerning the connection between evidential beliefs and belief change policies in rational agents. This proposal is found to be suffcient to (...) establish the truth of a much-discussed intuition regarding transmission failure. (shrink)

In earlier papers (Lindström & Rabinowicz, 1989. 1990), we proposed a generalization of the AGM approach to belief revision. Our proposal was to view belief revision as a relation rather thanas a function on theories (or belief sets). The idea was to allow for there being several equally reasonable revisions of a theory with a given proposition. In the present paper, we show that the relational approach is the natural result of generalizing in a certain way an approach to belief (...) revision due to Adam Grove. In his (1988) paper, Grove presents two closely related modelings of functional belief revision, one in terms of a family of "spheres" around the agent's theory G and the other in terms of an epistemic entrenchment ordering of propositions. The "sphere"-terminology is natural when one looks upon theories and propositions as being represented by sets of possible worlds. Grove's spheres may be thought of as possible "fallback" theories relative to the agent's original theory: theories that he may reach by deleting propositions that are not "sufficiently" entrenched (according to standards of sufficient entrenchment of varying stringency). To put it differently, fallbacks are theories that are closed upwards under entrenchment The entrenchment ordering can be recovered from the family of fallbacks by the definition: A is at least as entrenched as B iff A belongs to every fallback to which B belongs. To revise a theory T with a proposition A, we go to the smallest sphere that contain A-worlds and intersect it with A. The relational notion of belief revision that we are interested in, results from weakening epistemic entrenchment by not assuming it to be connected. I.e., we want to allow that some propositions may be incomparable with respect to epistemic entrenchment. As a result, the family of fallbacks around a given theory will no longer have to be nested. This change opens up the possibility for several different ways of revising a theory with a given proposition. (shrink)

Suppositions can be introduced in either the indicative or subjunctive mood. The introduction of either type of supposition initiates judgments that may be either qualitative, binary judgments about whether a given proposition is acceptable or quantitative, numerical ones about how acceptable it is. As such, accounts of qualitative/quantitative judgment under indicative/subjunctive supposition have been developed in the literature. We explore these four different types of theories by systematically explicating the relationships canonical representatives of each. Our representative qualitative accounts of indicative (...) and subjunctive supposition are based on the belief change operations provided by AGM revision and KM update respectively; our representative quantitative ones are offered by conditionalization and imaging. This choice is motivated by the familiar approach of understanding supposition as `provisional belief revision' wherein one temporarily treats the supposition as true and forms judgments by making appropriate changes to their other opinions. To compare the numerical judgments recommended by the quantitative theories with the binary ones recommended by the qualitative accounts, we rely on a suitably adapted version of the Lockean thesis. Ultimately, we establish a number of new results that we interpret as vindicating the often-repeated claim that conditionalization is a probabilistic version of revision, while imaging is a probabilistic version of update. (shrink)

Darwiche and Pearl’s seminal 1997 article outlined a number of baseline principles for a logic of iterated belief revision. These principles, the DP postulates, have been supplemented in a number of alternative ways. Most suggestions have resulted in a form of ‘reductionism’ that identifies belief states with orderings of worlds. However, this position has recently been criticised as being unacceptably strong. Other proposals, such as the popular principle (P), aka ‘Independence’, characteristic of ‘admissible’ operators, remain commendably more modest. In this (...) paper, we supplement the DP postulates and (P) with a number of novel conditions. While the DP postulates constrain the relation between a prior and a posterior conditional belief set, our new principles notably govern the relation between two posterior conditional belief sets obtained from a common prior by different revisions. We show that operators from the resulting family, which subsumes both lexicographic and restrained revision, can be represented as relating belief states associated with a ‘proper ordinal interval’ (POI) assignment, a structure more fine-grained than a simple ordering of worlds. We close the paper by noting that these operators satisfy iterated versions of many AGM era postulates, including Superexpansion, that are not sound for admissible operators in general. (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 we distinguish between various kinds of doxastic theories. One distinction is between informal and formal doxastic theories. AGM-type theories of belief change are of the former kind, while Hintikka’s logic of knowledge and belief is of the latter. Then we distinguish between static theories that study the unchanging beliefs of a certain agent and dynamic theories that investigate not only the constraints that can reasonably be imposed on the doxastic states of a rational agent but also rationality (...) constraints on the changes of doxastic state that may occur in such agents. An additional distinction is that between non-introspective theories and introspective ones. Non-introspective theories investigate agents that have opinions about the external world but no higher-order opinions about their own doxasticnstates. Standard AGM-type theories as well as the currently existing versions of Segerberg’s dynamic doxastic logic (DDL) are non-introspective. Hintikka-style doxastic logic is of course introspective but it is a static theory. Thus, the challenge remains to devise doxastic theories that are both dynamic and introspective. We outline the semantics for truly introspective dynamic doxastic logic, i.e., a dynamic doxastic logic that allows us to describe agents who have both the ability to form higher-order beliefs and to reflect upon and change their minds about their own (higher-order) beliefs. This extension of DDL demands that we give up the Preservation condition on revision. We make some suggestions as to how such a non-preservative revision operation can be constructed. We also consider extending DDL with conditionals satisfying the Ramsey test and show that Gärdenfors’ well-known impossibility result applies to such a framework. Also in this case, Preservation has to be given up. (shrink)

In this paper two systems of AGM-like Paraconsistent Belief Revision are overviewed, both defined over Logics of Formal Inconsistency (LFIs) due to the possibility of defining a formal consistency operator within these logics. The AGM° system is strongly based on this operator and internalize the notion of formal consistency in the explicit constructions and postulates. Alternatively, the AGMp system uses the AGM-compliance of LFIs and thus assumes a wider notion of paraconsistency - not necessarily related to the notion of formal (...) consistency. (shrink)

Este trabalho tem como principal objetivo apresentar uma abordagem lógico-formal capaz de apreender alguns aspectos do raciocínio abdutivo – o raciocínio responsável pela criação de hipóteses explicativas para fatos surpreendentes -, mediante tanto as noções filosófico-conceituais da canônica abdução peirceana quanto as de explicação científica. No caso desta última, procurarei evidenciar, inicialmente, pontos de contraste entre as concepções de explicação científica de Aristóteles e de Carl Hempel, a fim de elucidar, de modo mais satisfatório, em que medida, de fato, teorias (...) e hipóteses “explicam” algo. Apresentarei, também, um modo de tratar hipóteses explicativas contraditórias, por meio do operador de consistência ○ – próprio da lógica paraconsistente mbC -, o qual amplia o poder expressivo da linguagem-objeto subjacente ao sistema lógico, bem como apresentarei uma abordagem formal alternativa do raciocínio abdutivo pensado como dinâmica de mudança de crenças, especificamente por intermédio da lógica de revisão de crenças AGM. (shrink)

We propose a dynamic hyperintensional logic of belief revision for non-omniscient agents, reducing the logical omniscience phenomena affecting standard doxastic/epistemic logic as well as AGM belief revision theory. Our agents don’t know all a priori truths; their belief states are not closed under classical logical consequence; and their belief update policies are such that logically or necessarily equivalent contents can lead to different revisions. We model both plain and conditional belief, then focus on dynamic belief revision. The key idea we (...) exploit to achieve non-omniscience focuses on topic- or subject matter-sensitivity: a feature of belief states which is gaining growing attention in the recent literature. (shrink)

Belief revision theory studies how an ideal doxastic agent should revise her beliefs when she receives new information. In part I, I have first presented the AGM theory of belief revision. Then I have focused on the problem of iterated belief revisions. In part II, I will first present ranking theory (Spohn 1988). Then I will show how it solves the problem of iterated belief revisions. I will conclude by sketching two areas of future research.

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. (Revised) 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)

In this article we consider argumentation as an epistemic process performed by an agent to extend and revise her beliefs and gain knowledge, according to the information provided by the environment. Such a process can also generate the suspension of the claim under evaluation. How can we account for such a suspension phenomenon in argumentation process? We propose: (1) to distinguish two kinds of suspensions – critical suspension and non-critical suspension – in epistemic change processes; (2) to introduce a Paraconsistent (...) Weak Kleene logic (PWK) based belief revision theory which makes use of the notion of topic to distinguish the two kinds of suspensions previously mentioned, and (3) to develop a PWK-style argumentation framework and its expansion. By doing that, we can distinguish two kinds of suspensions in an epistemic process by virtue of the notion of topic. (shrink)

The theories of belief change developed within the AGM-tradition are not logics in the proper sense, but rather informal axiomatic theories of belief change. Instead of characterizing the models of belief and belief change in a formalized object language, the AGM-approach uses a natural language — ordinary mathematical English — to characterize the mathematical structures that are under study. Recently, however, various authors such as Johan van Benthem and Maarten de Rijke have suggested representing doxastic change within a formal logical (...) language: a dynamic modal logic. Inspired by these suggestions Krister Segerberg has developed a very general logical framework for reasoning about doxastic change: dynamic doxastic logic (DDL). This framework may be seen as an extension of standard Hintikka-style doxastic logic with dynamic operators representing various kinds of transformations of the agent's doxastic state. Basic DDL describes an agent that has opinions about the external world and an ability to change these opinions in the light of new information. Such an agent is non-introspective in the sense that he lacks opinions about his own belief states. Here we are going to discuss various possibilities for developing a dynamic doxastic logic for introspective agents: full DDL or DDL unlimited. The project of constructing such a logic is faced with difficulties due to the fact that the agent’s own doxastic state now becomes a part of the reality that he is trying to explore: when an introspective agent learns more about the world, then the reality he holds beliefs about undergoes a change. But then his introspective (higher-order) beliefs have to be adjusted accordingly. In the paper we shall consider various ways of solving this problem. (shrink)

In researching presuppositions dealing with logic and dynamic of belief we distinguish two related parts. The first part refers to presuppositions and logic, which is not necessarily involved with intentional operators. We are primarily concerned with classical, free and presuppositonal logic. Here, we practice a well known Strawson’s approach to the problem of presupposition in relation to classical logic. Further on in this work, free logic is used, especially Van Fraassen’s research of the role of presupposition in supervaluations logical systems. (...) At the end of the first part, presuppositional logic, advocated by S.K. Thomason, is taken into consideration. The second part refers to the presuppositions in relation to the logic of the dynamics of belief. Here the logic of belief change is taken into consideration and other epistemic notions with immanent mechanism for the presentation of the dynamics. Three representative and dominant approaches are evaluated. First, we deal with new, less classical, situation semantics. Besides Strawson’s theory, the second theory is the theory of the belief change, developed by Alchourron, Gärdenfors, and Makinson (AGM theory). At the end, the oldest, universal, and dominant approach is used, recognized as Hintikka’s approach to the analysis of epistemic notions. (shrink)

Starting from the sixties of the past century theory change has become a main concern of philosophy of science. Two of the best known formal accounts of theory change are the post-Popperian theories of verisimilitude (PPV for short) and the AGM theory of belief change (AGM for short). In this paper, we will investigate the conceptual relations between PPV and AGM and, in particular, we will ask whether the AGM rules for theory change are effective means for approaching the truth, (...) i.e., for achieving the cognitive aim of science pointed out by PPV. First, the key ideas of PPV and AGM and their application to a particular kind of propositional theories - the so called "conjunctive propositions" - will be illustrated. Afterwards, we will prove that, as far as conjunctive propositions are concerned, AGM belief change is an effective tool for approaching the truth. (shrink)

A Revisão de Crenças estuda como agentes racionais mudam suas crenças ao receberem novas informações. O sistema AGM, trabalho mais influente desta área apresentado por Alchourrón, Gärdenfos e Makinson, postula critérios de racionalidade para os diferentes tipos de mudança de crenças e oferece construções explícitas para tais - a equivalência entre os postulados e operações é chamado de teroema da representação. Trabalhos recentes mostram como o paradigma AGM pode ser compatível com diferentes lógicas não-clássicas, o que é chamado de AGM-compatibilidade (...) - este é o caso da família de lógicas paraconsistentes que analisamos, as Lógicas da Inconsistência Formal (LFIs, da sigla em inglês). A despeito da AGM-compatibilidade, ao se partir de uma nova lógica sua racionalidade subjacente deve ser entendida e sua linguagem deve ser efetivamente usada. Propomos assim novas construções que de fato capturam a intuição presente na LFIs - é o que chamamos de sistema AGMo. Com isso, possibilitamos a estas lógicas uma nova interpretação, na esteira da epistemologia formal. Em uma abordagem alternativa, ao se partir da AGM-compatibilidade os resultados AGM podem ser diretamente aplicados às LFIs - o que chamamos de sistema AGMp. Em ambas abordagens, provamos os respectivos teoremas da representação sempre que necessário. (shrink)

The field of iterated belief change has focused mainly on revision, with the other main operator of AGM belief change theory, i.e. contraction, receiving relatively little attention. In this paper we extend the Harper Identity from single-step change to define iterated contraction in terms of iterated revision. Specifically, just as the Harper Identity provides a recipe for defining the belief set resulting from contracting A in terms of (i) the initial belief set and (ii) the belief set resulting from revision (...) by ¬A, we look at ways to define the plausibility ordering over worlds resulting from contracting A in terms of (iii) the initial plausibility ordering, and (iv) the plausibility ordering resulting from revision by ¬A. After noting that the most straightforward such extension leads to a trivialisation of the space of permissible orderings, we provide a family of operators for combining plausibility orderings that avoid such a result. These operators are characterised in our domain of interest by a pair of intuitively compelling properties, which turn out to enable the derivation of a number of iterated contraction postulates from postulates for iterated revision. We finish by observing that a salient member of this family allows for the derivation of counterparts for contraction of some well known iterated revision operators, as well as for defining new iterated contraction operators. (shrink)

By Belief Revision it is understood a system that logically explains the rational process of changing beliefs by taking into account a new piece of information. The most influential approach in this field of study, the AGM system, proposed by Alchourrón, Gärdenfors, and Makinson, postulates rationality criteria for different types of belief change. In this paper I shall assess the relationship between those criteria and argue for an opposition between the principles of Information Economy and Consistency. Furthermore, I shall argue (...) that Paraconsistent Belief Revision manages to minimise this friction in the best possible way. (shrink)

As historically acknowledged in the Reasoning about Actions and Change community, intuitiveness of a logical domain description cannot be fully automated. Moreover, like any other logical theory, action theories may also evolve, and thus knowledge engineers need revision methods to help in accommodating new incoming information about the behavior of actions in an adequate manner. The present work is about changing action domain descriptions in multimodal logic. Its contribution is threefold: first we revisit the semantics of action theory contraction proposed (...) in previous work, giving more robust operators that express minimal change based on a notion of distance between Kripke-models. Second we give algorithms for syntactical action theory contraction and establish their correctness with respect to our semantics for those action theories that satisfy a principle of modularity investigated in previous work. Since modularity can be ensured for every action theory and, as we show here, needs to be computed at most once during the evolution of a domain description, it does not represent a limitation at all to the method here studied. Finally we state AGM-like postulates for action theory contraction and assess the behavior of our operators with respect to them. Moreover, we also address the revision counterpart of action theory change, showing that it benefits from our semantics for contraction. (shrink)

This paper is concerned with representations of belief by means of nonadditive probabilities of the Dempster-Shafer (DS) type. After surveying some foundational issues and results in the D.S. theory, including Suppes's related contributions, the paper proceeds to analyze the connection of the D.S. theory with some of the work currently pursued in epistemic logic. A preliminary investigation of the modal logic of belief functions à la Shafer is made. There it is shown that the Alchourrron-Gärdenfors-Makinson (A.G.M.) logic of belief change (...) is closely related to the D.S. theory. The final section compares the critique of Bayesianism which underlies the present paper with some important objections raised by Suppes against this doctrine. -/- . (shrink)

After a number of decades of research into the dynamics of rational belief, the belief revision theory community remains split on the appropriate handling of sequences of changes in view, the issue of so-called iterated revision. It has long been suggested that the matter is at least partly settled by facts pertaining to the results of various single revisions of one’s initial state of belief. Recent work has pushed this thesis further, offering various strong principles that ultimately result in a (...) wholesale reduction of iterated to one-shot revision. The present paper offers grounds to hold that these principles should be significantly weakened and that the reductionist thesis should ultimately be rejected. Furthermore, the considerations provided suggest a close connection between the logic of iterated belief change and the logic of evidential relevance. (shrink)

In the present paper, our objective is to examine the application of belief revision models to scientific rationality. We begin by considering the standard model AGM, and along the way a number of problems surface that make it seem inadequate for this specific application. After considering three different heuristics of informational economy that seem fit for science, we consider some possible adaptations for it and argue informally that, overall, some paraconsistent models seem to better satisfy these principles, following Testa (2015). (...) These models have been worked out in formal detail by Testa, Cogniglio, & Ribeiro (2015, 2017). (shrink)