Article ID Journal Published Year Pages File Type
376866 Artificial Intelligence 2014 16 Pages PDF
Abstract

Relations of epistemic proximity are closely related to relations of epistemic entrenchment, but contrary to the latter they do not refer to sentences but to belief patterns that are expressed with a metalinguistic belief predicate BB. Hence ¬Bp≻B¬q¬Bp≻B¬q means that disbelief in p is more close at hand (obtainable with less far-reaching changes in belief) than belief in not-q  . The logic of epistemic proximity is investigated, and it is used to construct a uniform operation of belief change that has the standard operations as special cases, specified with success conditions such as BpBp for revision and {¬Bp1,…,¬Bpn}{¬Bp1,…,¬Bpn} for multiple contraction. Standard entrenchment relations are obtained by defining p to be less entrenched than q   if and only if ¬Bp≻¬Bq¬Bp≻¬Bq.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Artificial Intelligence
Authors
,