Knowledge updates: Semantics and complexity issues

Chitta Baral, Yan Zhang

Research output: Contribution to journalArticle

31 Citations (Scopus)

Abstract

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 Σ2P-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.

Original languageEnglish (US)
Pages (from-to)209-243
Number of pages35
JournalArtificial Intelligence
Volume164
Issue number1-2
DOIs
StatePublished - May 2005

Fingerprint

Model checking
Semantics
semantics
Formal methods
logic
persistence
Computational complexity
Polynomials
Model Checking

Keywords

  • Belief revision and update
  • Complexity
  • Knowledge representation
  • Knowledge update
  • Kripke structures
  • S5 modal logic

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computational Theory and Mathematics

Cite this

Knowledge updates : Semantics and complexity issues. / Baral, Chitta; Zhang, Yan.

In: Artificial Intelligence, Vol. 164, No. 1-2, 05.2005, p. 209-243.

Research output: Contribution to journalArticle

Baral, Chitta ; Zhang, Yan. / Knowledge updates : Semantics and complexity issues. In: Artificial Intelligence. 2005 ; Vol. 164, No. 1-2. pp. 209-243.
@article{089c7cc4a16f4c5fa6e2896d80f180e5,
title = "Knowledge updates: Semantics and complexity issues",
abstract = "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 Σ2P-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.",
keywords = "Belief revision and update, Complexity, Knowledge representation, Knowledge update, Kripke structures, S5 modal logic",
author = "Chitta Baral and Yan Zhang",
year = "2005",
month = "5",
doi = "10.1016/j.artint.2005.01.005",
language = "English (US)",
volume = "164",
pages = "209--243",
journal = "Artificial Intelligence",
issn = "0004-3702",
publisher = "Elsevier",
number = "1-2",

}

TY - JOUR

T1 - Knowledge updates

T2 - Semantics and complexity issues

AU - Baral, Chitta

AU - Zhang, Yan

PY - 2005/5

Y1 - 2005/5

N2 - 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 Σ2P-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.

AB - 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 Σ2P-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.

KW - Belief revision and update

KW - Complexity

KW - Knowledge representation

KW - Knowledge update

KW - Kripke structures

KW - S5 modal logic

UR - http://www.scopus.com/inward/record.url?scp=16244392772&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=16244392772&partnerID=8YFLogxK

U2 - 10.1016/j.artint.2005.01.005

DO - 10.1016/j.artint.2005.01.005

M3 - Article

AN - SCOPUS:16244392772

VL - 164

SP - 209

EP - 243

JO - Artificial Intelligence

JF - Artificial Intelligence

SN - 0004-3702

IS - 1-2

ER -