Predicate calculus and program semantics
Predicate calculus and program semantics
Updating logical databases
A knowledge level analysis of belief revision
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Computing Circumscription Revisited: A Reduction Algorithm
Journal of Automated Reasoning
How to Solve Qualification and Ramification Using Dijkstra's Semantics for Programming Languages
AI*IA '97 Proceedings of the 5th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
The PMA and Relativizing Minimal Change for Action Update
Fundamenta Informaticae
| Hi-index | 0.00 |
Knowledge base update has been given much attention in the AI literature. The best-known solution to this problem is Winslett's PMA formalism. In this paper we propose different intuitions standing behind knowledge base update. Roughly speaking, we consider an update formula 驴 not as an effect of an action to be performed, but rather as an observation about dynamically changing world made by an agent. This observation, if it is consistent with the knowledge base, is assumed to be just a new piece of information about the world. Otherwise, it is assumed that a single action has been performed and 驴 is its, usually partial, effect.We formalize our approach using Dijkstra's semantics. We also examine the properties of our update operator with respect to Katsuno and Mendelzon's postulates.