Is it impossible to keep up to date?
Two different types of updates of information states are distinguished corresponding to two different kinds of incoming information: information about the actual state of domain; and information about changes made to the state of that domain. Gärdenfors  proves a theorem showing that the first kind of update function can have certain intuitively appealing properties only on pain of triviality. Here a similar trivialisation result is proved for the second kind of update function.
Unable to display preview. Download preview PDF.
- Gärdenfors, P. “Belief Revisions and the Ramsey Test for Conditionals”, Philosophical Review, 95, 1986.Google Scholar
- Gärdenfors, P. Knowledge in Flux, Bradford Books, MIT Press, Cambridge, Mass., 1988.Google Scholar
- Jeffrey, R.C. The Logic of Decision, McGraw Hill, New York, 1965.Google Scholar
- Katsuno, H., & Mendelzon, A. “On the Difference Between Updating a Knowledge Database and Revising It”, Technical Report, University of Toronto, 1990.Google Scholar
- Morreau, M. “Planning from First Principles”, in P. Gärdenfors (ed.), Belief Revision, Cambridge University Press, Cambridge 1991.Google Scholar
- Rott, H. “A Nonmonotonic Conditional Logic for Belief Revision I”, in A. Fuhrmann and M. Morreau (eds.), The Logic of Theory Change, Springer, Berlin, 1991.Google Scholar
- Winslett, M. “Reasoning about action using a possible models approach”, in Proceedings of AAAI, 1988.Google Scholar