Journal of Logic and Computation Advance Access originally published online on April 27, 2008
Journal of Logic and Computation 2009 19(3):447-459; doi:10.1093/logcom/exn008
| ||||||||||||||||||||||||||||||||||||||||||||||||
This article appears in the following Journal of Logic and Computation issue: Special Issue: Connections between Belief Revision, Belief Merging and Social Choice [View the issue table of contents]
Original Articles |
Geodesic Revision
Department of Mathematics and Computer Science, John Jay College, City University of New York, 445 West 59th Street, New York, NY 10019, USA.
E-mail: kgeorgatos{at}jjay.cuny.edu
Received 17 February 2007.
| Abstract |
|---|
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.
Keywords: Belief revision; distance-based reasoning; similarity; indistinguishability; indiscernibility