Propositional knowledge base revision and minimal change
Artificial Intelligence
What does a conditional knowledge base entail?
Artificial Intelligence
On the logic of iterated belief revision
Artificial Intelligence
A sequential reversible belief revision method based on polynomials
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
The Complexity of Iterated Belief Revision
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Changing Conditional Belief Unconditionally
Proceedings of the Sixth Conference on Theoretical Aspects of Rationality and Knowledge
System Z: a natural ordering of defaults with tractable applications to nonmonotonic reasoning
TARK '90 Proceedings of the 3rd conference on Theoretical aspects of reasoning about knowledge
On the logic of iterated belief revision
TARK '94 Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge
Revision sequences and nested conditionals
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
We propose a construction that allows to define operators for iterated revision from "classical" AGM revision operators. We call those operators revision with memory operators. We show that the operators obtained have nice logical properties.We illustrate this construction with the well-known Dalal revision operator. We also give two new particular revision operators based on the revision operators on OTP proposed by Ryan [20]. His operator do not satisfy a lot of logical properties. The two operators we give based on OTP satisfy all wanted revision properties.