2001
DOI: 10.2307/2694923
|View full text |Cite
|
Sign up to set email alerts
|

Distance semantics for belief revision

Abstract: 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 α as the theory defined by the set of all those models of α 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
70
0

Year Published

2006
2006
2023
2023

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 76 publications
(70 citation statements)
references
References 18 publications
0
70
0
Order By: Relevance
“…Data processing by distance considerations is not a new idea, and it has been used mainly in the context of query answering [1,2] integration of constraint belief-sets [25,26] and operators for belief revision [14,27,31]. In this paper we introduced a uniform framework for representing, comparing and implementing different approaches for these contexts.…”
Section: Resultsmentioning
confidence: 99%
“…Data processing by distance considerations is not a new idea, and it has been used mainly in the context of query answering [1,2] integration of constraint belief-sets [25,26] and operators for belief revision [14,27,31]. In this paper we introduced a uniform framework for representing, comparing and implementing different approaches for these contexts.…”
Section: Resultsmentioning
confidence: 99%
“…We give a generalized abstract nonsense result, taken from [5], which must be part of the folklore: Lemma 3.4. Given a set X and a binary relation R on X, there exists a total preorder (i.e., a total, reflexive, transitive relation) S on X that extends R such that ∀x, y ∈ X(xSy, ySx ⇒ xR * y) where R * is the reflexive and transitive closure of R.…”
Section: Background Materialsmentioning
confidence: 99%
“…We begin by recalling the notion of semantic distance proposed by Lehmann, Magidor and Schlechta [7] in the context of belief revision. We claim that this is appropriate as a measure of 'consistency distance' between formulae.…”
Section: A Semantic Distance For Inconsistent Informationmentioning
confidence: 99%