Switch to: References

Add citations

You must login to add citations.
  1. Two Approaches to Belief Revision.Ted Shear & Branden Fitelson - 2019 - Erkenntnis 84 (3):487-518.
    In this paper, we compare and contrast two methods for the revision of qualitative beliefs. The first method is generated by a simplistic diachronic Lockean thesis requiring coherence with the agent’s posterior credences after conditionalization. The second method is the orthodox AGM approach to belief revision. Our primary aim is to determine when the two methods may disagree in their recommendations and when they must agree. We establish a number of novel results about their relative behavior. Our most notable finding (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   28 citations  
  • Geodesic merging.Konstantinos Georgatos - 2018 - Synthese 195 (10):4243-4264.
    We pursue an account of merging through the use of geodesic semantics, the semantics based on the length of the shortest path on a graph. This approach has been fruitful in other areas of belief change such as revision and update. To this end, we introduce three binary merging operators of propositions defined on the graph of their valuations and we characterize them with a finite set of postulates.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
    		•
  • Conditioning by Minimizing Accessibility.Konstantinos Georgatos - 2010 - In Giacomo Bonanno, Benedikt Löwe & Wiebe Hoek (eds.), Logic and the Foundations of Game and Decision Theory €“ Loft 8. Springer Berlin Heidelberg. pp. 20-33.
    This paper presents an axiomatization of a class of set-theoretic conditional operators using minimization of the geodesic distance defined as the shortest path generated by the accessibility relation on a frame. The objective of this modeling is to define conditioning based on a notion of similarity generated by degrees of indistinguishability.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Iterated Contraction Based on Indistinguishability.Konstantinos Georgatos - 2013 - In Sergei Artemov & Anil Nerode (eds.), LFCS 2013. Springer. pp. 194–205.
    We introduce a class of set-theoretic operators on a tolerance space that models the process of minimal belief contraction, and therefore a natural process of iterated contraction can be defined. We characterize the class of contraction operators and study the properties of the associated iterated belief contraction.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation