The AGM success postulates for belief expansions and revisions have been widely criticized. This has resulted in the development of a number of non-prioritized belief change theories that violate these postulates. It is shown that we must also discard the monotony postulate for belief expansions if we abandon the success postulates. Non-prioritized belief change theories should instead fulfill a weaker postulate, which we call Conditional Monotony.

Two of the major problems in AGM-style belief revision, namely the difficulties in accounting for iterated change and for Ramsey test conditionals, have satisfactory solutions in descriptor revision. In descriptor revision, the input is a metalinguistic sentence specifying the success condition of the operation. The choice mechanism selects one of the potential outcomes in which the success condition is satisfied. Iteration of this operation is unproblematic. Ramsey test conditionals can be introduced without giving rise to the paradoxical results that they (...) generate in other systems. In addition to standard Ramsey test conditionals, a more general variant of epistemic conditionals is defined, representing statements of the form ”if the belief state is changed to satisfy condition A then it will satisfy condition B”. An axiomatic characterization of such descriptor conditionals is presented. It is related in intricate ways to the KLM postulates for cumulative reasoning. (shrink)

Kroedel has proposed a new solution, the permissibility solution, to the lottery paradox. The lottery paradox results from the Lockean thesis according to which one ought to believe a proposition just in case one’s degree of belief in it is sufficiently high. The permissibility solution replaces the Lockean thesis by the permissibility thesis according to which one is permitted to believe a proposition if one’s degree of belief in it is sufficiently high. This note shows that the epistemology of belief (...) that results from the permissibility thesis and the epistemology of degrees of belief is empty in the sense that one need not believe anything, even if one’s degrees of belief are maximally bold. Since this result can also be achieved by simply dropping the Lockean thesis, or by replacing it with principles that are logically stronger than the permissibility thesis, the question arises what the permissibility solution is a solution of. (shrink)

We explore the possibilities that dynamic epistemic logic offers to model abductive reasoning. We show that many of the problems with formal approaches to abduction based on classical logic can be solved when considering an epistemic agent that reasons and acts.Exploramos las posibilidades que ofrece la lógica epistémica dinámica para modelar el razonamiento abductivo. Mostramos que muchos de los problemas que encuentran los tratamientos formales de la abducción basados en lógica clásica pueden ser resueltos al considerar un agente epistémico que (...) razona y actúa. (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)

The pre-eminence of logical dynamics, over a static and purely propositional view of Logic, lies at the core of a new understanding of both formal epistemology and the logical foundations of quantum mechanics. Both areas appear at first sight to be based on purely static propositional formalisms, but in our view their fundamental operators are essentially dynamic in nature. Quantum logic can be best understood as the logic of physically-constrained informational interactions between subsystems of a global physical system. Similarly, epistemic (...) logic is the logic of socially-constrained informational interactions between “subsystems” of a social system. Dynamic Epistemic Logic provides us with a unifying setting in which these informational interactions, coming from seemingly very different areas of research, can be fully compared and analyzed. The DEL formalism comes with a powerful set of tools that allows us to make the underlying dynamic/interactive mechanisms fully transparent. (shrink)

Science advances by means of argument and debate. Based on a formal model of complex argumentation, this article assesses the interplay between evidential and inferential drivers in scientific controversy, and explains, in particular, why both evidence accumulation and argumentation are veritistically valuable. By improving the conditions for applying veritistic indicators , novel evidence and arguments allow us to distinguish true from false hypotheses more reliably. Because such veritistic indicators also underpin inductive reasoning, evidence accumulation and argumentation enhance the reliability of (...) inductive inference, for example, inference to the best explanation. 1 Introduction2 Theory of Dialectical Structures3 Debate Simulations4 From Evidence and Arguments to Truth: The First Route5 From Evidence to Truth: The Second Route6 Conclusion. (shrink)

Argumentation is a dialogical attempt to bring about a desired change in the beliefs of another agent – that is, to trigger a specific belief revision process in the mind of such agent. However, so far formal models of belief revision widely neglected any systematic comparison with argumentation theories, to the point that even the simplest argumentation structures cannot be captured within such models. In this essay, we endeavour to bring together argumentation and belief revision in the same formal framework, (...) and to highlight the important role played by Toulmin’s layout of argument in fostering such integration. (shrink)

Doxastic TheoriesThe application of formal tools to questions related to epistemology is of course not at all new. However, there has been a surge of interest in the field now known as “formal epistemology” over the past decade, with two annual conference series and an annual summer school at Carnegie Mellon University, in addition to many one-off events devoted to the field. A glance at the programs of these series illustrates the wide-ranging set of topics that have been grouped under (...) this name, ranging from rational choice theory and the foundations of statistics, to logics of knowledge and formal measures of coherence, with much more besides.In this paper I will ignore most of these topics, and just trace some parts of the history of two ideas about belief whose current interaction may lead to future progress. One idea is the idea of belief, disbelief, and suspension of judgment as a meaningful tripartite dis .. (shrink)

:A normative Bayesian theory of deliberation and judgement requires a procedure for merging the evidence of a collection of agents. In order to provide such a procedure, one needs to ask what the evidence is that grounds Bayesian probabilities. After finding fault with several views on the nature of evidence, it is argued that evidence is whatever is rationally taken for granted. This view is shown to have consequences for an account of merging evidence, and it is argued that standard (...) axioms for merging need to be altered somewhat. (shrink)

A new equivalent presentation of AGM revision is introduced, in which a preference-based choice function directly selects one among the potential outcomes of the operation. This model differs from the usual presentations of AGM revision in which the choice function instead delivers a collection of sets whose intersection is the outcome. The new presentation confirms the versatility of AGM revision, but it also lends credibility to the more general model of direct choice among outcomes of which AGM revision is shown (...) here to be a special case. (shrink)

In this paper we look at two classic methods of deriving consequences from inconsistent premises: Rescher-Manor and Schotch-Jennings. The overall goal of the project is to confine the method of drawing consequences from inconsistent sets to those that do not require reference to any information outside of very general facts about the set of premises. Methods in belief revision often require imposing assumptions on premises, e.g., which are the important premises, how the premises relate in non-logical ways. Such assumptions enable (...) one to select a reasonable collection of formulas from all the formulas of the language. Basic versions of the classic methods only use logical relations between the premises. We compare and criticize each of the classic views with an eye to combining the views to get the most out of inconsistent premises. We do this in a way that will respect the theoretical grounding of each view while meeting our other restrictions. (shrink)

In this paper we show how defeasible logic could formally account for the non-monotonic properties involved in motivational attitudes like intention and obligation. Usually, normal modal operators are used to represent such attitudes wherein classical logical consequence and the rule of necessitation comes into play, i.e., ⊢A/⊢ □A, that is from ⊢A derive ⊢ □A. This means that such formalisms are affected by the Logical Omniscience problem. We show that policy-based intentions exhibit non-monotonic behaviour which could be captured through a (...) non-monotonic system like defeasible logic. To this end we outline a defeasible logic of intention that specifies how modalities can be introduced and manipulated in a non-monotonic setting without giving rise to the problem of logical omniscience. In a similar way we show how to add deontic modalities defeasibly and how to integrate them with other motivational attitudes like beliefs and goals. Finally we show that the basic aspect of the BOID architecture is captured by this extended framework. (shrink)

We generalize AGM belief revision theory to the multi-agent case. To do so, we first generalize the semantics of the single-agent case, based on the notion of interpretation, to the multi-agent case. Then we show that, thanks to the shape of our new semantics, all the results of the AGM framework transfer. Afterwards we investigate some postulates that are specific to our multi-agent setting. Finally, we give an example of revision operator that fulfills one of these new postulates and give (...) an example of revision on a concrete example. (shrink)

Communication between natural or artificial agents relies on the use of a common vocabulary. Since sharing terms does not necessarily imply that the terms have exactly the same meanings for all agents, integrating statements into a formal ontology requires mechanisms for resolving conflicts that are caused by the ambiguity of terms specified in different but similar ontologies.We define and analyze a family of ontology-revision operators that resolve conflicts by disambiguating concept symbols occurring in both the ontology and the trigger statements. (...) The operators yield bridging axioms relating the different readings of the terms and, by including representations for both readings, preserve the initial ontology as well as the trigger statements. The operators differ regarding which reading of the ambiguous term is assigned to further uses of the common term and regarding the semantic relation assumed between the two readings. The ontology-revision operators are analyzed regarding their adaptability to consistent sequences of trigger statements. One group of operators preserves all conflicts with the trigger sequence. Operators from the other group can resolve the conflicts, which is demonstrated by showing under which conditions weak type-2 operators yield stabilizing sequences of ontologies. Stronger type-2 operators can result in closer approximations of the terminology underlying the sequence of trigger statements but can also yield non-stabilizing sequences of ontologies. (shrink)

This paper presents a Ramsey account of conditionals within the framework of an implemented reason maintenance system. The reason maintenance system is built on top of a deductive reasoning engine based on relevance logic. Thus, the account of conditionals provided is not susceptible to the fallacies of relevance. In addition, it is shown that independently motivated requirements on practical relevant reason maintenance allow us to gracefully circumvent Gärdenfors's triviality result.

Reasoning and change over inconsistent knowledge bases is of utmost relevance in areas like medicine and law. Argumentation may bring the possibility to cope with both problems. Firstly, by constructing an argumentation framework from the inconsistent KB, we can decide whether to accept or reject a certain claim through the interplay among arguments and counterarguments. Secondly, by handling dynamics of arguments of the AF, we might deal with the dynamics of knowledge of the underlying inconsistent KB. Dynamics of arguments has (...) recently attracted attention and although some approaches have been proposed, a full axiomatization within the theory of belief revision was still missing. A revision arises when we want the argumentation semantics to accept an argument. Argument Theory Change encloses the revision operators that modify the AF by analyzing dialectical trees—arguments as nodes and attacks as edges—as the adopted argumentation semantics. In this article, we present a simple approach to ATC based on propositional KBs. This allows to manage change of inconsistent KBs by relying upon classical belief revision, although contrary to it, consistency restoration of the KB is avoided. Subsequently, a set of rationality postulates adapted to argumentation is given, and finally, the proposed model of change is related to the postulates through the corresponding representation theorem. Though we focus on propositional logic, the results can be easily extended to more expressive formalisms such as first-order logic and description logics, to handle evolution of ontologies. (shrink)

Rational agents are important objects of study in several research communities, including economics, philosophy, cognitive science, and most recently computer science and artificial intelligence. Crudely, a rational agent is an entity that is capable of acting on its environment, and which chooses to act in such a way as to further its own best interests. There has recently been much interest in the use of mathematical logic for developing formal theories of such agents. Such theories view agents as practical reasoning (...) systems, deciding moment by moment which action to perform next, given the beliefs they have about the world and their desires with respect to how they would like the world to be. In this article, we survey the state of the art in developing logical theories of rational agency. Following a discussion on the dimensions along which such theories can vary, we briefly survey the logical tools available in order to construct such theories. We then review and critically assess three of the best known theories of rational agency: Cohen and Levesque's intention logic, Rao and Georgeff's BDI logics, and the KARO framework of Meyer et al. We then discuss the various roles that such logics can play in helping us to engineer rational agents, and conclude with a discussion of open problems. (shrink)

How does your information change when you learn that something might be the case, where the modal “might” is epistemic? On the orthodox view, a proposition is added to your information base; on the view defended here, no propositions are added to your information base but some are removed from it. I argue that Stephen Yablo’s recent attempt to define this removal operation as a kind of propositional subtraction fails, offer a definition of my own in terms of the part–whole (...) relations between the truthmakers of the propositions one accepts, and argue that a deontic analogue of this account solves a problem about permission posed long ago by David Lewis. (shrink)

When an agent undergoes fission, how should the beliefs of the fission results relate to the pre-fission beliefs? This question is important for the Everett interpretation of quantum mechanics, but it is of independent philosophical interest. Among other things, fission scenarios demonstrate that ‘self-locating’ information can affect the probability of uncentred propositions even if an agent has no essentially self-locating uncertainty. I present a general update rule for centred beliefs that gives sensible verdicts in cases of fission, without relying on (...) controversial metaphysical or linguistic assumptions. The rule is supported by the same considerations that support standard conditioning in the traditional framework of uncentred propositions. (shrink)

This article focuses on defective conditionals ? namely indicative conditionals whose antecedents are false and whose truth-values therefore cannot be determined. The problem is to decide which formal connective can adequately represent this usage. Classical logic renders defective conditionals true whereas traditional mathematics dismisses them as irrelevant. This difference in treatment entails that, at the propositional level, classical logic validates some sentences that are intuitively false in plane geometry. With two proofs, I show that the same flaw is shared by (...) a family of trivalent logics. I go on to examine the strict conditional and its derivatives. This family is the only one to avoid the faulty inference but it does so without addressing the status of the truth-value assigned to defective conditionals. (shrink)

In this paper, we investigate the problem of truth approximation via belief merging, i.e., we ask whether, and under what conditions, a group of inquirers merging together their beliefs makes progress toward the truth about the underlying domain. We answer this question by proving some formal results on how belief merging operators perform with respect to the task of truth approximation, construed as increasing verisimilitude or truthlikeness. Our results shed new light on the issue of how rational (dis)agreement affects the (...) inquirers’ quest for truth. In particular, they vindicate the intuition that scientific inquiry, and rational discussion in general, benefits from some heterogeneity in opinion and interaction among different viewpoints. The links between our approach and related analyses of truth tracking, judgment aggregation, and opinion dynamics, are also highlighted. (shrink)

Epistemic logic with its possible worlds semantic model is a powerful framework that allows us to represent an agent’s information not only about propositional facts, but also about her own information. Nevertheless, agents represented in this framework are logically omniscient: their information is closed under logical consequence. This property, useful in some applications, is an unrealistic idealisation in some others. Many proposals to solve this problem focus on weakening the properties of the agent’s information, but some authors have argued that (...) solutions of this kind are not completely adequate because they do not look at the heart of the matter: the actions that allow the agent to reach such omniscient state. Recent works have explored how acts of observation, inference, consideration and forgetting affect an agent’s implicit and explicit knowledge; the present work focuses on acts that affect an agent’s implicit and explicit beliefs. It starts by proposing a framework in which these two notions can be represented, and then it looks into their dynamics, first by reviewing the existing notion of belief revision, and then by introducing a rich framework for representing diverse forms of inference that involve both knowledge and beliefs. (shrink)

Belief fusion, instead of AGM belief revision, was first proposed to solve the problem of inconsistency, that arised from repetitive application of the operation when agents' knowledge were amalgamated. In the preceding work of Maynard-Reid II and Shoham, the fusion operator is applied to belief states, which is total preorders over possible worlds which is based on the semantics of belief revision. Moreover, they introduced the pedigreed belief state, which represented multiple sources of belief states, ordered by a credibility ranking. (...) However in the theory, all the sources must be totally ordered and thus applicable area is quite restrictive. In this paper, we realize the fusion operator of multiple agents for partially ordered sources. When we consider such a partial ranking over sources, there is no need to restrict that each agent has total preorders over possible worlds. The preferential model, based on the semantics on nonmonotonic reasoning, allows each agent to have strict partial orders over possible worlds. Especially, such an order is called a preferential relation, that prescribes a world is more plausible than the other. Therefore, we introduce an operation which combines multiple preferential relations of agents. In addition, we show that our operation can properly include the ordinary belief fusion. (shrink)

This survey is the first to review the combination of computational trust and argumentation. The combination of the two approaches seems like a natural match, with the two areas tackling different aspects of reasoning in an uncertain, social environment. We discuss the different areas of research and describe the approaches taken so far, analysing both how they address the problems and the challenges that are unaddressed.

Drawing inspiration from Lakatos’s philosophy of science, the paper presents a notion of intertheory explanation that is suitable to explain, from the point of view of a successor theory, its predecessor theory’s success (where it is successful) as well as the latter’s failure (where it fails) at the same time. A variation of the Ramsey-test is used, together with a standard AGM belief revision model, to give a semantics for open and counterfactual conditionals and ’because’-sentences featuring in such intertheory explanations. (...) Pre-theoretically described idealizing assumptions play a crucial role in this model, especially when the predecessor theory and the successor theory contradict each other. (shrink)

In our approach credibility of information plays an importantrole in modeling of both belief state and belief change [4]. It turns out thatthe credibility-based consequence operators used to define the notion of beliefstate tolerate inconsistency under some conditions.

We prove that for any finite deduction structure there exists a unique concise-widest chain-preserved split. Based on this result, we propose a logical splitting strategy which enables an agent to split its belief structure such that all the original inference chains can be preserved. The significance of such logical splitting at least is four-fold: It can be used by an agent to separate its concerns appropriately, or even create smaller and smarter clones which could save time and efforts in their (...) deliberation computing; It will enable an agent to adjust its concerns dynamically based on its recognition of the current situation, which may further enable the agent to make rapid and rational decisions when situation shifting occurs; In periodic team synchronization domains where agents can periodically synchronize their behaviors with no restriction on communication, it can be employed as a critical process for maintaining the shared mental models among a team of agents; and It is helpful in alleviating the complexity of reasoning about relevant information, and in better anticipating both explicit and implicit information needs based on the recognition of the current situation. (shrink)

The connections between nonmonotonic reasoning and belief revision are well-known. A central problem in the area of nonmonotonic reasoning is the problem of default entailment, i.e., when should an item of default information representing “if θ is true then, normally, φ is true” be said to follow from a given set of items of such information. Many answers to this question have been proposed but, surprisingly, virtually none have attempted any explicit connection to belief revision. The aim of this paper (...) is to give an example of how such a connection can be made by showing how the lexicographic closure of a set of defaults may be conceptualised as a process of iterated revision by sets of sentences. Specifically we use the revision method of Nayak. (shrink)

We present a method for relevance sensitive non-monotonic inference from belief sequences which incorporates insights pertaining to prioritized inference and relevance sensitive, inconsistency tolerant belief revision. Our model uses a finite, logically open sequence of propositional formulas as a representation for beliefs and defines a notion of inference from maxiconsistent subsets of formulas guided by two orderings: a temporal sequencing and an ordering based on relevance relations between the putative conclusion and formulas in the sequence. The relevance relations are ternary (...) (using context as a parameter) as opposed to standard binary axiomatizations. The inference operation thus defined easily handles iterated revision by maintaining a revision history, blocks the derivation of inconsistent answers from a possibly inconsistent sequence and maintains the distinction between explicit and implicit beliefs. In doing so, it provides a finitely presented formalism and a plausible model of reasoning for automated agents. (shrink)

We propose in this paper a new family of belief merging operators, that is based on a game between sources : until a coherent set of sources is reached, at each round a contest is organized to find out the weakest sources, then those sources has to concede. This idea leads to numerous new interesting operators and opens new perspectives for belief merging. Some existing operators are also recovered as particular cases. Those operators can be seen as a special case (...) of Booth's Belief Negotiation Models [BOO 02], but the achieved restriction forms a consistent family of merging operators that worths to be studied on its own. (shrink)

The expressive power of logic is believed to be able to model most of the fundamental aspects of information retrieval. However, it is also understood that classical logic is ineffective for handling partiality and uncertainty in IR. Applying non-classical logics such as the AGM belief revision logic and the possibilistic logic to adaptive information retrieval is appealing since they provide a powerful and rigorous framework to model partiality and uncertainty inherent in any IR processes. The maxi-adjustment method, which is an (...) effective computational apparatus of the AGM paradigm, is applied to develop the learning components of the adaptive information agents. Essentially, maxi-adjustment allows the partial representation K of a user's information needs N to be refined gradually based on the user's relevance feedback t. Generally speaking, learning in adaptive information agents is characterised by the AGM belief revision Kt*. On the other hand, possibilistic logic supports a gradated assessment of the uncertainty arising from matching K with the imperfect characterisation d of an information object D. Information matching in adaptive information agents is underpinned by K ƕ d, where ƕ is the possibilistic inference relation. This paper illustrates how maxi-adjustment and possibilistic deduction can be applied to develop the adaptive information agents. Their impact on the agents learning autonomy and explanatory power is also discussed. (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)

In the area known as model-based diagnosis, a system is described by-means of a set of formulas together with assumptions that all the components are functioning correctly. When we observe a behavior of the system which is inconsistent with the system description, we must relax some of the assumptions. In previous work, we have presented operations of belief change which only affect the relevant part of a belief base. In this paper, we propose the application of the same strategy to (...) the problem of model-based diagnosis. We Erst isolate the subset of the system description which is relevant for a given observation. By doing this, we reduce the size of the problem and then solve the diagnosis problem for the relevant subset. (shrink)

The outcome set of a belief change operator is the set of outcomes that can be obtained with it. Axiomatic characterizations are reported for the outcome sets of the standard AGM contraction operators and eight types of base-generated contraction. These results throw new light on the properties of some of these operators.

Is it possible to give an explicit definition of belief in terms of subjective probability, such that believed propositions are guaranteed to have a sufficiently high probability, and yet it is neither the case that belief is stripped of any of its usual logical properties, nor is it the case that believed propositions are bound to have probability 1? We prove the answer is ‘yes’, and that given some plausible logical postulates on belief that involve a contextual “cautiousness” threshold, there (...) is but one way of determining the extension of the concept of belief that does the job. The qualitative concept of belief is not to be eliminated from scientific or philosophical discourse, rather, by reducing qualitative belief to assignments of resiliently high degrees of belief and a “cautiousness” threshold, qualitative and quantitative belief turn out to be governed by one unified theory that offers the prospects of a huge range of applications. Within that theory, logic and probability theory are not opposed to each other but go hand in hand. (shrink)