Conditioning by minimizing accessibility
LOFT'08 Proceedings of the 8th international conference on Logic and the foundations of game and decision theory
| Hi-index | 0.00 |
The purpose of this article is to introduce a class of distance-based iterated revision operators generated by minimizing the geodesic distance on a graph. Such operators correspond bijectively to metrics and have a simple finite presentation. As distance is generated by distinguishability, our framework is appropriate for modelling contexts where distance is generated by threshold, and therefore, when measurement is erroneous.