In [11] it is shown how propositional dynamic logic (PDL) can be interpreted as a logic of belief revision that extends the logic of communication and change (LCC) given in [7]. This new version of epistemic/doxastic PDL does not impose any constraints on the basic relations and because of this it does not suffer from the drawback of LCC that these constraints may get lost under updates that are admitted by the system. Here, we will impose one constraint, (...) namely that the agent’s plausibility relations are linked. Linkedness is a natural extension of local connectedness to the multi-agent case and it assures that we know the agent’s preferences between all relevant alternatives. Since the belief updates that are used in [11] may not preserve linkedness, we limit ourselves to a particular kind of belief change that does preserve it. Our framework has obvious connections to coalition logic [17] and social choice theory [19]. We show how we can use it to model consensus seeking in plenary Dutch meetings. In Dutch meetings, a belief update is done for all agents in the meeting if a majority beliefs the proposition that is under discussion. A special case of these meetings is judgement aggregation, and we apply our framework to the discursive dilemma in this field [15]. (shrink)

In this paper we forge a connection between dynamic epistemic logics of belief revision on one hand and studies of collective judgement and multi-agent preference change on the other. Belief revision in the spirit of dynamic epistemic logic uses updating with relational substitutions to change the beliefs of individual agents. Collective judgement in social choice theory studies the collective outcomes of individual belief changes. We start out from the logic of communication and change (...) (LCC), which is basically epistemic propositional dynamic logic (PDL) extended with update action modalities. We show how epistemic PDL can be made to handle belief operators. Our new version of epistemic/doxastic PDL does not impose any constraints on the basic relations. Because of this it does not suffer from the drawback of LCC that constraints on epistemic relations, such as transitivity and reflexivity, may get lost under updates that are admitted by the system. After introducing the base system without constraints, we study the effects of imposing a single constraint, namely the constraint that the agent’s preference relations are linked. Linkedness is a natural extension of local connectedness to the multi-agent case. It assures that if Alice prefers y to x and Bob prefers z to x, then both Alice and Bob can make up their minds when given a choice between y and z. Since general belief changes may not preserve linkedness, we propose a recipe for belief change that does preserve it. Finally, we show that the resulting framework can be used to model consensus seeking procedures. We focus on the case of plenary Dutch meetings. In Dutch meetings, a belief change (or rather: preference change) is performed for all agents in the meeting if a majority believes (or: is in favour of) the proposition that is under discussion. A special case of these meetings is judgement aggregation, and we apply our framework to the discursive dilemma in.. (shrink)

A semantics is presented for belief-revision in the face of common announcements to a group of agents that have beliefs about each other's beliefs. The semantics is based on the idea that possible worlds can be viewed as having an internal structure, representing the belief independent features of the world, and the respective belief states of the agents in a modular fashion. Modularity guarantees that changing one aspect of the world (a belief independent feature or (...) a belief state) has no effect on any other aspect of the world. This allows us to employ an AGM-style selection function to represent revision. The semantics is given a complete axiomatisation (identical to the axiomatisation found by Gerbrandy and Groeneveld for a semantics based on non-wellfounded set theory) for the special case of expansion. (shrink)

A semantics is presented for belief revision in the face of common announcements to a group of agents that have beliefs about each other’s beliefs. The semantics is based on the idea that possible worlds can be viewed as having an internal-structure, representing the belief independent features of the world, and the respective belief states of the agents in a modular fashion. Modularity guarantees that changing one aspect of the world (a belief independent feature or (...) a belief state) has no effect on any other aspect of the world. This allows us to employ an AGM-style selection function to represent revision. The semantics is given a complete axiomatisation (identical to the axiomatisation found by Gerbrandy and Groeneveld for a semantics based on non-wellfounded set theory) for the special case of expansion. (shrink)

Krister Segerberg proposed irrevocable belief revision, to be contrasted with standard belief revision, in a setting wherein belief of propositional formulas is modelled explicitly. This suggests that in standard belief revision is revocable: one should be able to unmake (‘revoke’) the fresh belief in the revision formula, given yet further information that contradicts it. In a dynamic epistemic logical setting for belief revision, for multiple agents, we investigate what the (...) requirements are for revocable belief revision. By this we not merely mean recovering belief in non-modal propositions, as in the recovery principle for belief contraction, but recovering belief in modal propositions: beliefs about beliefs. These requirements are almost never met, a surprising result. (shrink)

This special issue of the Logic Journal of the IGPL includes revised and updated versions of the best work presented at the fourth edition of the workshop Formal Ap- proaches to Multi-Agent Systems, FAMAS'09, which took place in Turin, Italy, from 7 to 11 September, 2009, under the umbrella of the Multi-Agent Logics, Languages, and Organisations Federated Workshops (MALLOW). -/- Just like its predecessor, research reported in this FAMAS 2009 special issue is very much inspired by (...) practical concerns. This time the authors of all the five selected papers are concerned with knowledge and beliefs in multi-agent settings: How to create a group belief in a fair way from individual plausibility orderings? How to close gaps and resolve ambiguities in a tractable way, when information comes from multiple sources? How to reason about a spatial environment? How to compare the strengths of an agent's beliefs in a principled way? How to decide as efficiently as possible whether a given formula concerning group beliefs is valid? These questions and their answers lead to a multi-faceted and at the same time coherent special issue. We concisely introduce the five articles. (shrink)

This paper shows how propositional dynamic logic can be interpreted as a logic for multi-agent belief revision. For that we revise and extend the logic of communication and change of [9]. Like LCC, our logic uses PDL as a base epistemic language. Unlike LCC, we start out from agent plausibilities, add their converses, and build knowledge and belief operators from these with the PDL constructs. We extend the update mechanism of LCC to an update (...) mechanism that handles belief change as relation substitution, and we show that the update part of this logic is more expressive than either that of LCC or that of doxastic/epistemic PDL with a belief change modality. It is shown that the properties of knowledge and belief are preserved under any update, and that the logic is complete. © 2008 Springer-Verlag Berlin Heidelberg. (shrink)

A formal model for updates—the result of learning that the world has changed—in a multi-agent setting is presented and completely axiomatized. The model allows that several agents simultaneously are informed of an event in the world in such a way that it becomes common knowledge among the agents that the event has occurred. The model shares many features with the model for common announcements—an announcement about the state of the world in which it becomes common knowledge among the (...) audience that the announcement has been made—presented in Cantwell (2005), but exploits the difference between learning that a state of the world obtains and learning that the state of the world has changed. (shrink)

In ‘belief revision’ a theory\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\cal K}$$\end{document} is revised with a formula φ resulting in a revised theory \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\cal K}\ast\varphi$$\end{document}. Typically, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\neg\varphi$$\end{document} is in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\cal K}$$\end{document}, one has to give up belief in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\neg\varphi$$\end{document} (...) by a process of retraction, and φ is in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\cal K}\ast\varphi$$\end{document}. We propose to model belief revision in a dynamic epistemic logic. In this setting, we typically have an information state (pointed Kripke model) for the theory \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\cal K}$$\end{document} wherein the agent believes the negation of the revision formula, i.e., wherein \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B\neg\varphi$$\end{document} is true. The revision with φ is a program *φ that transforms this information state into a new information state. The transformation is described by a dynamic modal operator [*φ], that is interpreted as a binary relation [ [*φ] ] between information states. The next information state is computed from the current information state and the belief revision formula. If the revision is successful, the agent believes φ in the resulting state, i.e., Bφ is then true. To make this work, as information states we propose ‘doxastic epistemic models’ that represent both knowledge and degrees of belief. These are multi-modal and multi-agent Kripke models. They are constructed from preference relations for agents, and they satisfy various characterizable multi-agent frame properties. Iterated, revocable, and higher-order belief revision are all quite natural in this setting. We present, for an example, five different ways of such dynamic belief revision. One can also see that as a non-deterministic epistemic action with two alternatives, where one is preferred over the other, and there is a natural generalization to general epistemic actions with preferences. (shrink)

In ‘belief revision’ a theory is revised with a formula φ resulting in a revised theory . Typically, is in , one has to give up belief in by a process of retraction, and φ is in . We propose to model belief revision in a dynamic epistemic logic. In this setting, we typically have an information state (pointed Kripke model) for the theory wherein the agent believes the negation of the revision formula, (...) i.e., wherein is true. The revision with φ is a program *φ that transforms this information state into a new information state. The transformation is described by a dynamic modal operator [*φ], that is interpreted as a binary relation [ [*φ] ] between information states. The next information state is computed from the current information state and the belief revision formula. If the revision is successful, the agent believes φ in the resulting state, i.e., Bφ is then true. To make this work, as information states we propose ‘doxastic epistemic models’ that represent both knowledge and degrees of belief. These are multi-modal and multi-agent Kripke models. They are constructed from preference relations for agents, and they satisfy various characterizable multi-agent frame properties. Iterated, revocable, and higher-order belief revision are all quite natural in this setting. We present, for an example, five different ways of such dynamic belief revision. One can also see that as a non-deterministic epistemic action with two alternatives, where one is preferred over the other, and there is a natural generalization to general epistemic actions with preferences. (shrink)

There are different varieties of conservatism concerning belief formation and revision. We assesses the veritistic effects of a particular kind of conservatism commonly attributed to Quine: the so-called maxim of minimum mutiliation, which states that agents should give up as few beliefs as possible when facing recalcitrant evidence. Based on a formal bounded rationality model of belief revision, which parametrizes degree of conservatism, and corresponding multi-agent simulations, we eventually argue against doxastic conservatism from the (...) vantage point of veritistic social epistemology. (shrink)

This talk shows how propositional dynamic logic (PDL) can be interpreted as a logic for multi-agent knowledge update and belief revision, or as a logic of preference change, if the basic relations are read as preferences instead of plausibilities. Our point of departure is the logic of communication and change (LCC) of [9]. Like LCC, our logic uses PDL as a base epistemic language. Unlike LCC, we start out from agent plausibilities, add their converses, and (...) build knowledge and belief operators from these with the PDL constructs. We extend the update mechanism of LCC to an update mechanism that handles belief change as relation substitution, and we show that the update part of this logic is more expressive than either that of LCC or that of epistemic/doxastic PDL with a belief change modality. Next, we show that the properties of knowledge and belief are preserved under any update, unlike in LCC. We prove completeness of the logic and give examples of its use. If there is time, we will also look at the preference interpretation of the system, and at preference change scenarios that can be modelled with it. (shrink)

We address the issue of belief revision in a multi-agent setting. We represent agents' beliefs in a semantic manner, through a Kripke structure, and model a communication process by which agents communicate their beliefs to one another. We define a revision rule that can be applied even when agents have contradictory beliefs. We study its properties and show that agents need not agree after communicating their beliefs. We finally address the dynamics of revision and (...) show that the order of communication may affect the resulting belief structure. (shrink)

We model three examples of beliefs that agents may have about other agents’ beliefs, and provide motivation for this conceptualization from the theory of mind literature. We assume a modal logical framework for modelling degrees of belief by partially ordered preference relations. In this setting, we describe that agents believe that other agents do not distinguish among their beliefs (‘no preferences’), that agents believe that the beliefs of other agents are in part as their own (‘my preferences’), and the (...) special case that agents believe that the beliefs of other agents are exactly as their own (‘preference refinement’). This multi-agent belief interaction is frame characterizable. We provide examples for introspective agents. We investigate which of these forms of belief interaction are preserved under three common forms of belief revision. (shrink)

In the literature of belief revision, it is widely accepted that: there is only one revision phase in belief revision which is well characterized by the Bayes’ Rule, Jeffrey’s Rule, etc.. However, as I argue in this article, there are at least four successive phases in belief revision, namely first/second order evaluation and first/second order revision. To characterize these phases, I propose mainly four rules of belief revision based on (...) class='Hi'>agent’s criteria, and make one composition rule to characterize belief revision as a whole. (shrink)

In studies of multi-agent interaction, especially in game theory, the notion of equilibrium often plays a prominent role. A typical scenario for the belief merging problem is one in which several agents pool their beliefs together to form a consistent "group" picture of the world. The aim of this paper is to define and study new notions of equilibria in belief merging. To do so, we assume the agents arrive at consistency via the use of a (...) social belief removal function, in which each agent, using his own individual removal function, removes some belief from his stock of beliefs. We examine several notions of equilibria in this setting, assuming a general framework for individual belief removal due to Booth et al. We look at their inter-relations as well as prove their existence or otherwise. We also show how our equilibria can be seen as a generalisation of the idea of taking maximal consistent subsets of agents. (shrink)

Agents which perform inferences on the basis of unreliable information need an ability to revise their beliefs if they discover an inconsistency. Such a belief revision algorithm ideally should be rational, should respect any preference ordering over the agent’s beliefs (removing less preferred beliefs where possible) and should be fast. However, while standard approaches to rational belief revision for classical reasoners allow preferences to be taken into account, they typically have quite high complexity. In this (...) paper, we consider belief revision for agents which reason in a simpler logic than full first-order logic, namely rule-based reasoners. We show that it is possible to define a contraction operation for rule-based reasoners, which we call McAllester contraction, which satisfies all the basic Alchourrón, Gärdenfors and Makinson (AGM) postulates for contraction (apart from the recovery postulate) and at the same time can be computed in polynomial time. We prove a representation theorem for McAllester contraction with respect to the basic AGM postulates (minus recovery), and two additional postulates. We then show that our contraction operation removes a set of beliefs which is least preferred, with respect to a natural interpretation of preference. Finally, we show how McAllester contraction can be used to define a revision operation which is also polynomial time, and prove a representation theorem for the revision operation. (shrink)

In this paper we propose an approach to multi-source belief revision where the trust or credibility assigned to informant agents can be revised. In our proposal, the credibility of each informant represented as a strict partial order among informant agents, will be maintained in a repository called credibility base. Upon arrival of new information concerning the credibility of its peers, an agent will be capable of revising this strict partial order, changing the trust assigned to its (...) peers accordingly. Our goal is to formalize a set of change operators over the credibility base: expansion, contraction, prioritized, and non-prioritized revision. These operators will provide the capability of dynamically modifying the credibility of informants considering the reliability of the information. This dynamics will reflect a new perception of trust assigned to the informant, or extend the set of informants by admitting the addition of new informant agents. (shrink)

We model three examples of beliefs that agents may have about other agents' beliefs, and provide motivation for this conceptualization from the theory of mind literature. We assume a modal logical framework for modelling degrees of belief by partially ordered preference relations. In this setting, we describe that agents believe that other agents do not distinguish among their beliefs ('no preferences'), that agents believe that the beliefs of other agents are in part as their own ('my preferences'), and the (...) special case that agents believe that the beliefs of other agents are exactly as their own ('preference refinement'). This multi-agent belief interaction is frame characterizable. We provide examples for introspective agents. We investigate which of these forms of belief interaction are preserved under three common forms of belief revision. (shrink)

We give a model for iterated belief change in multi-agent systems. The formal tool we use for this is a combination of modal and dynamic logic. Two core notions in our model are the expansion of the knowledge and beliefs of an agent, and the processing of new information. An expansion is defined as the change in the knowledge and beliefs of an agent when it decides to believe an incoming formula while holding on to (...) its current propositional beliefs. To prevent our agents from forming inconsistent beliefs they do not expand with every piece of information they receive. Instead, our agents remember their original beliefs and every piece of information they receive. After every receipt of information they decide which subset of the received information should be incorporated into their original beliefs. This procedure is called the processing of new information. We show that our model of belief update behaves in an intuitive way and that it is not sensitive to criticism on comparable models. (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. (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)

The theory of belief revision deals with (rational) changes in beliefs in response to new information. In the literature a distinction has been drawn between belief revision and belief update (see [6]). The former deals with situations where the objective facts describing the world do not change (so that only the beliefs of the agent change over time), while the letter allows for situations where both the facts and the doxastic state of the (...) class='Hi'>agent change over time. We focus on belief revision and propose a temporal framework that allows for iterated revision. We model the notion of “minimal” or “conservative” belief revision by considering logics of increasing strength. We move from one logic to the next by adding one or more axioms and show that the corresponding logic captures more stringent notions of minimal belief revision. The strongest logic that we propose provides a full axiomatization of the well-known AGM theory of belief revision. (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. (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)

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.

A program for the simulation of rational social normative trust, predictive `trust,' and predictive reliance between agents will be introduced. It offers a tool for social scientists or a trust component for multi-agent simulations/multi-agent systems, which need to include trust between agents to guide the decisions about the course of action. It is based on an analysis of rational social normative trust (RSNTR) (revised version of M. Tuomela 2002), which is presented and briefly argued. For collective (...) agents, belief conditions for collective agency should be added. For the various forms of trust agents must have (at least) subjectively rational reasons to believe that the conditions of the trust account are fulfilled. A list of such reasons (of varied weights), e.g., given by empirical research, can manually be built into a parameter file or be generated by a calling program in a fixed format. From this list of reasons the program randomly generates a belief base for the agents of the artificial society. Reasons can be chained together so that one set of reasons satisfies several belief conditions. The program checks if the conditions are fulfilled for the artificial agents' social normative trust/predictive `trust'/`predictive reliance' in another agent that he will perform an action X. Each outcome is logged to a result file. In conclusion we discuss various aspects of the application of a trust component of the suggested kind in empirical research, social simulation, and multi-agent systems. (shrink)

The well known AGM framework for belief revision has recently been extended to include a model of the research agenda of the agent, i.e. a set of questions to which the agent wishes to find answers (Olsson & Westlund in Erkenntnis , 65 , 165–183, 2006 ). The resulting model has later come to be called interrogative belief revision . While belief revision has been studied extensively from the point of view of (...) modal logic, so far interrogative belief revision has only been dealt with in the metalanguage approach in which AGM was originally presented. In this paper, I show how to model interrogative belief revision in a modal object language using a class of operators for questions. In particular, the solution I propose will be shown to capture the notion of K-truncation , a method for agenda update in the case of expansion constructed by Olsson & Westlund. Two case studies are conducted: first, an interrogative extension of Krister Segerberg’s system DDL, and then a similar extension of Giacomo Bonanno’s modal logic for belief revision. Sound and complete axioms will be provided for both of the resulting logics. (shrink)

Belief revision theory concerns methods for reformulating an agent's epistemic state when the agent's beliefs are refuted by new information. The usual guiding principle in the design of such methods is to preserve as much of the agent's epistemic state as possible when the state is revised. Learning theoretic research focuses, instead, on a learning method's reliability or ability to converge to true, informative beliefs over a wide range of possible environments. This paper bridges the (...) two perspectives by assessing the reliability of several proposed belief revision operators. Stringent conceptions of minimal change are shown to occasion a limitation called inductive amnesia: they can predict the future only if they cannot remember the past. Avoidance of inductive amnesia can therefore function as a plausible and hitherto unrecognized constraint on the design of belief revision operators. (shrink)

The logic of Conditional Beliefs has been introduced by Board, Baltag, and Smets to reason about knowledge and revisable beliefs in a multi-agent setting. In this article both the semantics and the proof theory for this logic are studied. First, a natural semantics forCDLis defined in terms of neighbourhood models, a multi-agent generalisation of Lewis’ spheres models, and it is shown that the axiomatization ofCDLis sound and complete with respect to this semantics. Second, it is shown (...) that the neighbourhood semantics is equivalent to the original one defined in terms of plausibility models, by means of a direct correspondence between the two types of models. On the basis of neighbourhood semantics, a labelled sequent calculus forCDLis obtained. The calculus has strong proof-theoretic properties, in particular admissibility of contraction and cut, and it provides a decision procedure for the logic. Furthermore, its semantic completeness is used to obtain a constructive proof of the finite model property of the logic. Finally, it is shown that other doxastic operators can be easily captured within neighbourhood semantics. This fact provides further evidence of the naturalness of neighbourhood semantics for the analysis of epistemic/doxastic notions. (shrink)

We present a model for studying communities of epistemically interacting agents who update their belief states by averaging the belief states of other agents in the community. The agents in our model have a rich belief state, involving multiple independent issues which are interrelated in such a way that they form a theory of the world. Our main goal is to calculate the probability for an agent to end up in an inconsistent belief state due (...) to updating. To that end, an analytical expression is given and evaluated numerically, both exactly and using statistical sampling. It is shown that, under the assumptions of our model, an agent always has a probability of less than 2% of ending up in an inconsistent belief state. Moreover, this probability can be made arbitrarily small by increasing the number of independent issues the agents have to judge or by increasing the group size. A real-world situation to which this model applies is a group of experts participating in a Delphi-study. (shrink)

I develop a dynamic logic for reasoning about "interrogative belief revision", a new branch of belief revision theory that has been developed in a small number of papers, beginning with E. J. Olsson and D. Westlund's paper "On the role of the research agenda in epistemic change" [12]. In interrogative belief revision, epistemic states are taken to include a research agenda, consisting of questions the agent seeks to answer. I present a logic for (...) revision of such epistemic states based on the notion of an epistemic strategy, a stable plan of action that determines changes in the agent's research agenda. This idea is a further development of an idea put forward in [6], that changes in the research agenda of an agent should be determined by stable, "long term" research interests. I provide complete axioms and a decidability result for the logic. (shrink)

The standard theory for belief revision provides an elegant and powerful framework for reasoning about how a rational agent should change its beliefs when confronted with new information. However, the agents considered are extremely idealized. Some recent models attempt to tackle the problem of plausible belief revision by adding structure to the belief bases and using nonstandard inference operations. One of the key ideas is that not all of an agent's beliefs are relevant (...) for an operation of belief change.In this paper we incorporate the insights pertaining to local change and relevance sensitivity with the use of approximate inference relations. These approximate inference relations offer us partial solutions at any stage of the revision process. The quality of the approximations improves as we allow for more and more resources to be used. We are provided with upper and lower bounds to what would be obtained with the use of classical inference. (shrink)

Postulational approaches attempt to understand the dynamics of belief revision by appealing to no more than the set of beliefs held by an agent and the logical relations between them. It is argued there that such an approach cannot work. A proper account of belief revision must also appeal to the arguments supporting beliefs, and recognize that those arguments can be defeasible. If we begin with a mature epistemological theory that accommodates this, it can be (...) seen that the belief revision operators on which the postulational theories are based are ill-defined. It is further argued that there is no way to repair the definitions so as to retain the spirit of those theory. Belief revision is better studied from within an independently motivated epistemological theory. (shrink)

Philosophical logicians proposing theories of rational belief revision have had little to say about whether their proposals assist or impede the agent's ability to reliably arrive at the truth as his beliefs change through time. On the other hand, reliability is the central concern of formal learning theory. In this paper we investigate the belief revision theory of Alchourron, Gardenfors and Makinson from a learning theoretic point of view.

The paper argues that much of the difficulty with making progress on the issue of the normativity of logic for thought, as discussed in the literature, stems from a misapprehension of what logic is normative for. The claim is that, rather than mono-agent mental processes, logic in fact comprises norms for quite specific situations of multi-agent dialogical interactions, in particular special forms of debates. This reconceptualization is inspired by historical developments in logic and mathematics, in particular the (...) pervasiveness of such dialogical conceptions in the early days of logic in ancient Greece. The multi-agent, dialogical perspective then allows for the formulation of compelling 'bridge principles’ between the relation of logical consequence and dialogical normative principles, something that is notoriously difficult to achieve in a mono-agent setting pertaining exclusively to thought and belief. The upshot is also that the truth-preserving rules of logic generally do not have a primary normative bearing on mono-agent mental processes, and in this sense the paper sides with Harman's critique of the idea that logic has a normative import for thought and belief. (shrink)

Belief revision theories standardly endorse a principle of intensionality to the effect that ideal doxastic agents do not discriminate between pieces of information that are equivalent within classical logic. I argue that this principle should be rejected. Its failure, on my view, does not require failures of logical omniscience on the part of the agent, but results from a view of the update as _mighty_: as encoding what the agent learns might be the case, as well (...) as what must be. The view is motivated by consideration of a puzzle case, obtained by transposing into the context of belief revision a kind of scenario that Kit Fine has used to argue against intensionalism about counterfactuals. Employing the framework of truthmaker semantics, I go on to develop a novel account of belief revision, based on a conception of the update as mighty, which validates natural hyperintensional counterparts of the usual AGM postulates. (shrink)

The paper attacks the almost universally held view that belief revison theories, as they have been studied in the literature of the past two decades, are founded on a Principle of Minimal Change, or Principle of Informational Economy. The principle comes in two versions. According to the first, an agent should, when accepting new information, aim at a posterior belief set that minimizes the items on which it disagrees with the prior belief set. If there are (...) different ways to effect the belief change, then according to the second version, the agent should give up the beliefs that are least entrenched. Although widely endorsed and advertised by belief revision theorists, the paper argues that both versions of the principle are dogmas that are not in fact (and perhaps should not be) adhered to. Two simple mathematical observations substantiate this claim, and it is defended against four possible objections that involve contractions, reconstructions, dispositions, and truths. (shrink)

We examine carefully the rationale underlying the approaches to belief change taken in the literature, and highlight what we view as methodological problems. We argue that to study belief change carefully, we must be quite explicit about the ontology or scenario underlying the belief change process. This is something that has been missing in previous work, with its focus on postulates. Our analysis shows that we must pay particular attention to two issues that have often been taken (...) for granted: the first is how we model the agent's epistemic state. (Do we use a set of beliefs, or a richer structure, such as an ordering on worlds? And if we use a set of beliefs, in what language are these beliefs are expressed?) We show that even postulates that have been called beyond controversy are unreasonable when the agent's beliefs include beliefs about her own epistemic state as well as the external world. The second is the status of observations. (Are observations known to be true, or just believed? In the latter case, how firm is the belief?) Issues regarding the status of observations arise particularly when we consider iterated belief revision, and we must confront the possibility of revising by and then by ¬. (shrink)

The paper attacks the widely held view that belief revision theories, as they have been studied in the past two decades, are founded on the Principle of Informational Economy. The principle comes in two versions. According to the first, an agent should, when accepting a new piece of information, aim at a minimal change of his previously held beliefs. If there are different ways to effect the belief change, then the agent should, according to he (...) second version, give up those beliefs that are least entrenched. Although widely proclaimed by belief revision theorists, I argue that both versions of the principle are dogmas that are not (and perhaps should not be) adhered to. I substantiate this claim with two simple mathematical observations, and I defend it against four possible objections that involve contractions, reconstructions, dispositions, and truths. (shrink)

This is a short version of Lindström & Rabinowicz 1991.In earlier papers, we proposed a generalization of the AGM approach to belief revision. The proposal was to view belief revision as a relation rather than as a function on theories (or belief sets). Going relational means that one allows for 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 presented 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 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). 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 if one allows 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)

Over the last decade, multi-agent systems have come to form one of the key tech- nologies for software development. The Formal Approaches to Multi-Agent Systems (FAMAS) workshop series brings together researchers from the fields of logic, theoreti- cal computer science and multi-agent systems in order to discuss formal techniques for specifying and verifying multi-agent systems. FAMAS addresses the issues of logics for multi-agent systems, formal methods for verification, for example model (...) check- ing, and formal approaches to cooperation, multi-agent planning, communication, coordination, negotiation, games, and reasoning under uncertainty in a distributed environment. In 2007, the third FAMAS workshop, FAMAS'007, was one of the agent workshops gathered together under the umbrella of Multi-Agent Logics, Languages, and Organ- isations - Federated Workshops, MALLOW'007, taking place from 3 to 7 September 2007 in Durham. This current special issue of the Logic Journal of the IGPL gathers together the revised and updated versions of the five best FAMAS'007 contributions. (shrink)

We introduce a new operator, called rational evaluation, in belief change. The operator evaluates new information according to the agent’s core beliefs, and then exports the plausible part of the new information. It belongs to the decision module in belief change. We characterize rational evaluation by axiomatic postulates and propose two functional constructions for it, based on the well-known constructions of kernel sets and remainder sets, respectively. The main results of the paper are two representation theorems with (...) respect to the two functional constructions. We also compare and connect the evaluation operator with some related operators in belief revision, including contraction, set contraction, and prioritized multiple revision. (shrink)

In this paper, we compare and contrast two methods for the revision of qualitative beliefs. The first method is generated by a simplistic diachronic Lockean thesis requiring coherence with the agent’s posterior credences after conditionalization. The second method is the orthodox AGM approach to belief revision. Our primary aim is to determine when the two methods may disagree in their recommendations and when they must agree. We establish a number of novel results about their relative behavior. (...) Our most notable finding is that the inverse of the golden ratio emerges as a non-arbitrary bound on the Bayesian method’s free-parameter—the Lockean threshold. This “golden threshold” surfaces in two of our results and turns out to be crucial for understanding the relation between the two methods. (shrink)

This thesis deals with the theory of interrogative belief revision, a recent development in the subfield of philosophical logic known as belief revision theory. While classical belief revision theory deals with the dynamics of an agent’s beliefs, interrogative belief revision aims to describe the dynamics of the agent’s questions about the world, or research agenda, as well. Great emphasis is put on the interaction between belief change and changes in (...) the research agenda. I develop both the technical framework for this theory by constructing and investigating modal logics for reasoning about the dynamics of research interests, as well as pursuing further the philosophical foundations and applications of the theory. Among the contributions of the thesis are: - a novel interpretation of the theory founded on a notion of epistemic strategies - a solution to the previously open problem of contraction and revision in this context - several systems of modal logic that can be used to reason about interrogative belief revision - completeness results and decidability results for these logics - a characterization of a class of relevant conditionals based on a notion of agenda relevance. (shrink)

This book covers lymphoproliferative disorders in patients with congenital or acquired immunodeficiencies. Acquired immunodeficiencies are caused by infections with the human immunodeficiency virus or arise following immunosuppressive therapy administered after organ transplantation or to treat connective tissue diseases such as rheumatoid arthritis. It was recently discovered that various diseases or therapeutic modalities that induce a state of immunosuppression may cause virally driven lymphoproliferations. This book summarizes for the first time this group of immunodeficiency-associated lymphoproliferations.