Two-level credibility-limited revision is a non-prioritized revision operation. When revising through a two-level credibility-limited revision, two levels of credibility and one level of incredibility are considered. When revising by a sentence at the highest level of credibility, the operator behaves like a standard revision, if the sentence is at the second level of credibility, the revision process results in a standard contraction by the negation of that sentence. If the sentence is not credible, then the original belief set remains unchanged. In this article, we introduce a novel constructive method for two-level credibility-limited revision operators, based on a modified version of entrenchment relations. Additionally, we propose a semantics for this type of operators, based on Grove’s systems of spheres. Furthermore, we present axiomatic characterizations for the newly proposed operators.

In the last decades, user profiles have been used in several areas of information technology. In the literature, most research works, and systems focus on the creation of profiles (using Data Mining techniques based on user's navigation or interaction history). In general, the dynamics of profiles are made by means of a systematic recreation of the profiles, without using the previous profiles. In this paper we propose to formalize the creation, representation, and dynamics of profiles from a Knowledge-Driven perspective. We introduce and axiomatically characterize four operators for changing profiles using a belief change inspired approach.

In this paper, we introduce recuperative withdrawals, belief change operators that satisfy recuperation, a postulate weaker than recovery, all the AGM postulates for contraction except recovery and another postulate which is a slightly stronger condition than conjunctive inclusion. Furthermore, we present a constructive definition for a class of operators —named ring withdrawals— which are such that the outcome of a ring withdrawal of a belief set K by a sentence α is obtained by adding to the set of most plausible models ‖K‖ all the worlds which are as close to ‖K‖ as its closest ¬α-worlds. Ring withdrawals satisfy the Lindström and Rabinowicz's interpolation thesis. We show that the classes of recuperative withdrawals and of ring withdrawals are identical. Additionally we show that the class of ring withdrawals is not contained in and does not contain the class of AGM contractions or the class of severe withdrawals. Finally we present methods for defining an operator of ring withdrawal by means of a severe withdrawal operator and by means of an AGM contraction operator, and vice-versa.

In this paper, we investigate the relation between shielded base contraction postulates and credibility-limited (CL) base revision postulates. More precisely, we identify (i) the relation between the postulates satisfied by a shielded base contraction operator and the postulates satisfied by the CL base revision operator that is defined from it by means of the consistency-preserving Levi identity and (ii) the relation between the postulates satisfied by a CL base revision operator and the postulates satisfied by the shielded base contraction operator that is defined from it by means of the Harper identity. Furthermore, we show that the consistency-preserving Levi identity and the Harper identity establish a one-to-one correspondence between the twenty classes of shielded base contractions presented in [21] and the twenty classes of credibility-limited base revisions presented in [22].

Selective Revision was proposed by Fermé and Hansson as a belief revision operation in which it is possible to accept only a part of the input information. In this paper, we extend Selective Revision to belief bases and also to logics not closed under negation.

In this paper we study a kind of operator —known as credibility-limited base revisions— which addresses two of the main issues that have been pointed out to the AGM model of belief change. Indeed, on the one hand, these operators are defined on belief bases (rather than belief sets) and, on the other hand, they are constructed with the underlying idea that not all new information is accepted. We propose twenty different classes of credibility-limited base revision operators and obtain axiomatic characterizations for each of them. Additionally we thoroughly investigate the interrelations (in the sense of inclusion) among all those classes. More precisely, we analyse whether each one of those classes is or is not (strictly) contained in each of the remaining ones.

In this paper we study a kind of non-prioritized contraction operator on belief bases -known as shielded base contractions. We propose twenty different classes of shielded base contractions and obtain axiomatic characterizations for each one of them. Additionally we thoroughly investigate the interrelations (in the sense of inclusion) among all those classes.

In this article we present an axiomatic characterization for the ensconcement-based contractions. We study the interrelation among ensconcement-based contractions and brutal contractions, and we present two ways of defining an ensconcement relation by means of a base contraction operation. Finally, we study the interrelations among ensconcement-based contraction and epistemic entrenchment-based contractions and among brutal contractions and severe withdrawals.