Abstract
Belief revision deals with the problem of changing a declaratively specified repository under a new piece of potentially conflicting information. Ever since the first formal treatment of belief revision, representation theorems are considered important, not to say, canonical means to analyse belief revision operators. This chapter discusses representation theorems for a special kind of change operators, called reinterpretation operators, which resolve conflicts by disambiguating symbols. Moreover, it shows how various classical belief revision operators can be represented equivalently as reinterpretation operators.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Özçep, Ö.L. (2019). Representation for Belief Revision. In: Representation Theorems in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-25785-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-25785-9_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-25784-2
Online ISBN: 978-3-030-25785-9
eBook Packages: Computer ScienceComputer Science (R0)