Distance Semantics for Belief Revision
| dc.creator | Lehmann, Daniel | |
| dc.creator | Magidor, Menachem | |
| dc.creator | Schlechta, Karl | |
| dc.date | 2002-02-18 | |
| dc.date.accessioned | 2026-07-07T03:18:08Z | |
| dc.date.available | 2026-07-07T03:18:08Z | |
| dc.description | A vast and interesting family of natural semantics for belief revision is defined. Suppose one is given a distance d between any two models. One may then define the revision of a theory K by a formula a as the theory defined by the set of all those models of a that are closest, by d, to the set of models of K. This family is characterized by a set of rationality postulates that extends the AGM postulates. The new postulates describe properties of iterated revisions. | |
| dc.description | Preliminary version presented at TARK '96 | |
| dc.identifier | https://arxiv.org/abs/cs/0202025 | |
| dc.identifier | http://arxiv.org/abs/cs/0202025 | |
| dc.identifier | Journal of Symbolic Logic, Vol. 66 No.1 (March 2001) pp. 295-317 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30995 | |
| dc.subject | Artificial Intelligence | |
| dc.subject | I.2.3 | |
| dc.title | Distance Semantics for Belief Revision | |
| dc.type | text |