Updating epistemic states

6Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Belief update is usually defined by means of operators acting on belief sets. We propose here belief update operators acting on epistemic states which convey much more information than belief sets since they express the relative plausibilities of the pieces of information believed by the agent. In the following, epistemic states are encoded as rankings on worlds. We extend a class of update operators (dependency- based updates) to epistemic states, by defining an operation playing the same role as knowledge transmutations [21] do for belief revision.

Cite

CITATION STYLE

APA

Lang, J., Marquis, P., & Williams, M. A. (2001). Updating epistemic states. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2256, pp. 297–308). Springer Verlag. https://doi.org/10.1007/3-540-45656-2_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free