Distance semantics for belief revision

Authors:
Karl Schlechta;Daniel Lehmann;Menachem Magidor
Affiliations:
Université de Provence, France;Hebrew University, Israel;Hebrew University, Israel
Venue:
TARK '96 Proceedings of the 6th conference on Theoretical aspects of rationality and knowledge
Year:
1996

Citing 5
Cited 2

Nonmonotonic reasoning, preferential models and cumulative logics

Artificial Intelligence
What does a conditional knowledge base entail?

Artificial Intelligence
Nonmonotonic inference based on expectations

Artificial Intelligence
On the logic of iterated belief revision

TARK '94 Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge
Belief revision, revised

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2

Admissible and restrained revision

Journal of Artificial Intelligence Research
Confluence operators and their relationships with revision, update and merging

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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 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.