Multiple semi-revision in possibilistic logic

Authors:
Guilin Qi;Weiru Liu;David A. Bell
Affiliations:
School of Computer Science, Queen's University Belfast, Belfast, UK;School of Computer Science, Queen's University Belfast, Belfast, UK;School of Computer Science, Queen's University Belfast, Belfast, UK
Venue:
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Year:
2005

Citing 8
Cited 0

Epistemic entrenchment and possibilistic logic

Artificial Intelligence
Possibilistic logic

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Kernel contraction

Journal of Symbolic Logic
Possibilistic Merging and Distance-Based Fusion of Propositional Information

Annals of Mathematics and Artificial Intelligence
Arbitration (or How to Merge Knowledge Bases)

IEEE Transactions on Knowledge and Data Engineering
A Practical Approach to Fusing Prioritized Knowledge Bases

EPIA '99 Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Preferred subtheories: an extended logical framework for default reasoning

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Measuring conflict and agreement between two prioritized belief bases

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.