The paper develops an inductive extension of AGM-style belief base revision theory with the aim of formally implementing Freitag’s :254–267, 2015, Dialectica 70:185–200, 2016) solution to Goodman’s paradox. It shows that the paradox dissolves once belief revision takes place on inductively closed belief bases, rather than on belief sets.

The AGM theory of belief revision provides a formal framework to represent the dynamics of epistemic states. In this framework, the beliefs of the agent are usually represented as logical formulas while the change operations are constrained by rationality postulates. In the original proposal, the logic underlying the reasoning was supposed to be supraclassical, among other properties. In this paper, we present some of the existing work in adapting the AGM theory for non-classical logics and discuss their interconnections and what (...) is still missing for each approach. (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 standard theory of belief revision was developed to describe how a rational agent should change his beliefs in the presence of new information. Many interesting tools were created, but the concept of rationality was usually assumed to be related to classical logics. In this paper, we explore the fact that the logical tools used can be extended to other sorts of logics, as proved in (Hansson and Wassermann, 2002), to describe models that are closer to the rationality of a (...) real agent. (shrink)

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)

Contractions on belief sets that have no finite representation cannot be finite in the sense that only a finite number of sentences is removed. However, such contractions can be delimited so that the actual change takes place in a logically isolated, finite-based part of the belief set. A construction that answers to this principle is introduced, and is axiomatically characterized. It turns out to coincide with specified meet contraction.

We can often specify how we would contract by a certain sentence by saying that this contraction would coincide with some other contraction that we know how to perform. We can for instance clarify that our contraction by p&q would coincide with our contraction by p, or by q, or by {p, q}. In a framework where the set of potential outcomes is known, some contractions are “self-evident” in the sense that there is only one serious candidate that can be (...) the outcome of such a contraction. Contraction by a specific contractee (sentence or set of sentences to be contracted) is bootstrapped if it is specified by saying that it coincides with some such self-evident contraction. For a wide range of (multiple) contraction operators, contractions by any contractee can be bootstrapped. This means that the selection mechanism (selection function, incision function, etc.) can be replaced by a function called a bootstrapping selector that assigns to each contractee some “self-evident” contractee that yields the same outcome. With bootstrapping we can eliminate traditional extralogical components in contraction (e.g., selection functions) and replace them by bootstrapping selectors that reflect more closely the ways in which we actually reason and argue about belief contraction. (shrink)

Although formal system verification has been around for many years, little attention was given to the case where the specification of the system has to be changed. This may occur due to a failure in capturing the clients’ requirements or due to some change in the domain (think for example of banking systems that have to adapt to different taxes being imposed). We are interested in having methods not only to verify properties, but also to suggest how the system model (...) should be changed so that a property would be satisfied. For this purpose, we will use techniques from the area of Belief Revision, that deals with the problem of changing a knowledge base in view of new information. In the last thirty years, several authors have contributed with change operations and ways of characterizing them. However, most of the work concentrates on knowledge bases represented using classical propositional logic. In the last decade, there have been efforts to apply belief revision theory to description and modal logics. In this work, we analyze what is needed for a theory of belief revision which can be applied to the temporal logic, such as the Computation Tree Logic (CTL). In particular, we illustrate different alternatives for formalizing the concept of revision of CTL. Our interest in this particular logic comes both from practical issues, since it is used for software specification, as from theoretical issues, as it is a non-compact logic and most existing results rely on compactness. We focus here on the revision of CTL models and present a characterization result for the revision of partial models. (shrink)

The 1985 paper by Carlos Alchourrón (1931–1996), Peter Gärdenfors, and David Makinson (AGM), "On the Logic of Theory Change: Partial Meet Contraction and Revision Functions" was the starting-point of a large and rapidly growing literature that employs formal models in the investigation of changes in belief states and databases. In this review, the first twentyfive years of this development are summarized. The topics covered include equivalent characterizations of AGM operations, extended representations of the belief states, change operators not included in (...) the original framework, iterated change, applications of the model, its connections with other formal frameworks, computatibility of AGM operations, and criticism of the model. (shrink)

The problem of knowledge evolution has received considerable attention over the years. Mainly, the study of the dynamics of knowledge has been addressed in the area of Belief Revision, a field emerging as the convergence of the efforts in Philosophy, Logic, and more recently Computer Science, where research efforts usually involve “flat” knowledge bases where there is no additional information about the formulas stored in it. Even when this may be a good fit for particular applications, in many real-world scenarios (...) different information items may be attached to formulas. For instance, when the reliability of the source of the piece of information is attached to it as a measure of some quality (e.g., strength) of the piece of information itself, or when some characteristic informs us on the desirability of the item (e.g., the potential benefit that could be obtained from it). If this type of information is available, we can use it to guide how the belief base is to be modified when new information arrives. In this work, we present a novel approach to the contraction of knowledge bases where formulas have values attached that measure some quality linked to those formulas, exploiting it to define their desirability, and uses such desirability to define which formulas need to be removed to solve conflicts. In this context, we introduce a set of properties for contraction operators by extending classic approaches. We also show how the local treatment of minimal conflicts can induce some counter-intuitive contractions, and we present a way to avoid them by considering optimal resolutions of conflicts using the additional information encoded. We show how the proposed formalization captures any contraction that is optimal under a set of features. Finally, we present a refinement based on the identification of related minimal conflicts that performs contraction in optimal ways without looking into the entire knowledge base. The approach is based on the use of the accrual of beliefs where several formulas collaboratively use their respective values to prevail in the resolution of conflicts. (shrink)

We look at the problem of revising fuzzy belief bases, i.e., belief base revision in which both formulas in the base as well as revision-input formulas can come attached with varying degrees. Working within a very general framework for fuzzy logic which is able to capture certain types of uncertainty calculi as well as truth-functional fuzzy logics, we show how the idea of rational change from “crisp” base revision, as embodied by the idea of partial meet (base) revision, can be (...) faithfully extended to revising fuzzy belief bases. We present and axiomatise an operation of partial meet fuzzy base revision and illustrate how the operation works in several important special instances of the framework. We also axiomatise the related operation of partial meet fuzzy base contraction. (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)

This paper aims at comparing and relating belief revision and argumentation as approaches to model reasoning processes. Referring to some prominent literature references in both fields, we will discuss their (implicit or explicit) assumptions on the modeled processes and hence commonalities and differences in the forms of reasoning they are suitable to deal with. The intended contribution is on one hand assessing the (not fully explored yet) relationships between two lively research fields in the broad area of defeasible reasoning and (...) on the other hand pointing out open issues and potential directions for future research. (shrink)

This paper argues that formal models of coherence are useful for constructing a legal epistemology. Two main formal approaches to coherence are examined: coherence-based models of belief revision and the theory of coherence as constraint satisfaction. It is shown that these approaches shed light on central aspects of a coherentist legal epistemology, such as the concept of coherence, the dynamics of coherentist justification in law, and the mechanisms whereby coherence may be built in the course of legal decision-making.

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)