Knowledge forgetting: properties and applications
type: Item
instance of: scholarly article
title: Knowledge forgetting: properties and applications
zbMATH Open document ID: 1187.03015
author: J. Blot
published in: Artificial Intelligence
publication date: 2009-12-21T00:00:00Z
review text: The concept of `forgetting' an elementary letter in a propositional formula has a neat syntactic definition in the context of classical logic: just take the disjunction of the result of substituting the falsum and the truum respectively in the formula. But this definition is not suitable in nonclassical contexts, in particular modal ones. For example, in the modal logic S5, such an operation applied to a formula expressing the contingency of a letter would give a contradiction. In the last few years a semantic definition of forgetting a letter in a formula of S5 (called knowledge forgetting) has gained acceptance, but to now it has lacked a syntactic characterization. This paper fills the gap, giving four sound postulates and proving their completeness. It goes on to compare forgetting in S5 with updating in the same context as the latter is defined in an earlier paper of \textit{C. Baral} and \textit{Y. Zhang} [``Knowledge updates: Semantics and complexity issues'', Artif. Intell. 164, No.~1--2, 209--243 (2005; Zbl 1132.68720)]. The most straightforward way of defining update from forgetting in the S5 context fails to satisfy the Katsuno-Mendelzon postulate (U8); but a more complex definition is formulated and shown to yield all of those postulates, at least in the finite case. Finally, the paper studies an application of the notion of forgetting in the S5 context, to the analysis of a certain game with bounded memory.
reviewed by: David Makinson
Mathematics Subject Classification ID: 03B42
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68T30
zbMATH DE Number: 5650764
zbMATH Keywords: epistemic reasoning
zbMATH Keywords: reasoning about belief and knowledge
zbMATH Keywords: knowledge update
zbMATH Keywords: knowledge games
zbMATH Keywords: nonmonotonic reasoning
MaRDI profile type: Publication
full work available at URL: j.artint.2009.07.005
OpenAlex ID: W2154114149
cites work: Knowledge updates: Semantics and complexity issues
cites work: Modal logic
cites work: The logic of Pit
cites work: Dynamic Epistemic Logic and Knowledge Puzzles
cites work: Introspective forgetting
cites work: Q4522247
cites work: Semantic forgetting in answer set programming
cites work: Q4845472
cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
cites work: Q3107917
cites work: Undefinability of propositional quantifiers in the modal system S4
cites work: Q3509053
cites work: Propositional belief base update and minimal change
cites work: Q4028812
cites work: Q4411161
cites work: On strongest necessary and weakest sufficient conditions
cites work: Q4835902
cites work: Complete axiomatizations for reasoning about knowledge and branching time
cites work: Agent-oriented epistemic reasoning: Subjective conditions of knowledge and belief
cites work: Solving logic program conflict through strong and weak forgettings
DOI: 10.1016/J.ARTINT.2009.07.005
Recommended article: Introspective forgetting
Recommended article: A Knowledge Level Account of Forgetting
Recommended article: Bounds to memory loss
Recommended article: Forgetting complex propositions
Recommended article: Knowledge updates: Semantics and complexity issues
Recommended article: Kinds and Aspects of Forgetting in Common-Sense Knowledge and Belief Management
Recommended article: Forgetting in multi-agent modal logics
Recommended article: Semantic forgetting in answer set programming
description: scientific article; zbMATH DE number 5650764