Conditioning by minimizing accessibility

Authors:
Konstantinos Georgatos
Affiliations:
Department of Mathematics and Computer Science, John Jay College, City University of New York, New York, NY and The Graduate Center, City University of New York, New York, NY
Venue:
LOFT'08 Proceedings of the 8th international conference on Logic and the foundations of game and decision theory
Year:
2008

Citing 9
Cited 0

Automatic text processing: the transformation, analysis, and retrieval of information by computer

Automatic text processing: the transformation, analysis, and retrieval of information by computer
A model-theoretic analysis of knowledge

Journal of the ACM (JACM)
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Set-theoretic completeness for epistemic and conditional logic

Annals of Mathematics and Artificial Intelligence
Geodesic Revision

Journal of Logic and Computation
Revision sequences and nested conditionals

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
A unified view of consequence relation, belief revision and conditional logic

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Weak AGM postulates and strong Ramsey Test: A logical formalization

Artificial Intelligence
Similarity relations and fuzzy orderings

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.