.png){kind=icon}
.png){kind=icon}
Return
Knowledge updates: Semantics and complexity issues
.png){kind=icon}
PRE
AI
DOI：10.1016/j.artint.2005.01.005.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider the problem of updating of an agent's knowledge. We propose a formal method of knowledge update on the basis of the semantics of modal logic S5. In our method, an update is specified according to the minimal change on both the agent's actual world and knowledge. We discuss general minimal change properties of knowledge update and show that our knowledge update operator satisfies all the update postulates of Katsuno and Mendelzon. We characterize several specific forms of knowledge update which have important applications in reasoning about change of agents' knowledge. We also examine the persistence property of knowledge and ignorance associated with knowledge update. We then investigate the computational complexity of model checking for knowledge update. We first show that in general the model checking for knowledge update is Sigma(P)(2)-complete. We then identify a subclass of knowledge update problems that has polynomial time complexity for model checking. We point out that some important knowledge update problems belong to this subclass. We further address another interesting subclass of knowledge update problems for which the complexity of model checking is NP-complete. (c) D 2005 Elsevier B.V. All rights reserved.
Keywords:
belief revision and updated
complexity
knowledge representation
knowledge updated
Kripke structures
S5 modal logic
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W
Organization
No organization information available