A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in ...
This paper presents both a semantic and a computational model for multi-agent belief revision. We show that these two models are equivalent but serve different purposes. The seman...
Semantic structures for belief revision are proposed. We start with one-stage revision structures that generalize the notion of choice function from rational choice theory. A corr...
ABSTRACT: In this paper I present the model of ‘bounded revision’ that is based on two-dimensional revision functions taking as arguments pairs consisting of an input sentence ...
In this paper, we propose a new approach for iterated revision in possibilistic logic by applying a one-step revision operator. We first argue that the set of KM postulates for re...