Semi-revision is a model of belief change that differs from revision in that a new formula is not always accepted. Later, Fuhrmann defined multiple semi-revision by replacing a new formula with a set of formulae as the new information, which results in a merging operator called a partial meet merging operator. The problem for the partial meet merging operator is that it needs additional information to define a selection function which selects a subset from a set of maximal consistent subbases of an inconsistent knowledge base. In this paper, we will extend multiple semi-revision in the framework of possibilistic logic. The advantage of possibilistic logic is that it provides an ordering relation on formulae in knowledge bases, which makes it easy to define a selection function practically.
Guilin Qi, Weiru Liu, David A. Bell