Propositional knowledge base revision and minimal change
Artificial Intelligence
On the logic of iterated belief revision
Artificial Intelligence
Merging with Integrity Constraints
ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Dynamic belief revision operators
Artificial Intelligence
On the logic of iterated belief revision
TARK '94 Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge
PRICAI'00 Proceedings of the 6th Pacific Rim international conference on Artificial intelligence
Hi-index | 0.00 |
In this work we extend the framework of logic-based fusion by Konieczny and Pino Pérez [8,9,10,11] to complex epistemic states. We present some postulates given in terms of the finite propositional logic which define merging operators of complex epistemic states. We state some representation theorems for these operators. When we consider concrete spaces, namely those where the epistemic states are total preorders over valuations, we obtain strong representation theorems. This new framework allows us to generalize, in a natural way, the revision operators presented by Benferhat et al. [2]. As an application of our representation theorems, we define some merging operators over complex epistemic states and show some examples of these operators at work.