Bounded Forgetting

Yi Zhou; Yan Zhang

doi:10.1609/aaai.v25i1.7842

Bounded Forgetting

Yi Zhou
, Yan Zhang

School of Computer, Data & Mathematical Sciences

Research output: Chapter in Book / Conference Paper › Conference Paper › peer-review

8 Citations (Scopus)

Abstract

The result of forgetting some predicates in a first-order sentence may not exist in the sense that it might not be captured by any first-order sentences. This, indeed, severely restricts the usage of forgetting in applications. To address this issue, we propose a notion called k-forgetting, also called bounded forgetting in general, for any fixed number k. We present several equivalent characterizations of bounded forgetting and show that the result of bounded forgetting, on one hand, can always be captured by a single first-order sentence, and on the other hand, preserves the information that we are concerned with.

Original language	English
Title of host publication	Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011
Publisher	AAAI Press
Pages	280-285
Number of pages	6
ISBN (Electronic)	9781577355083
DOIs	https://doi.org/10.1609/aaai.v25i1.7842
Publication status	Published - 11 Aug 2011
Event	25th AAAI Conference on Artificial Intelligence, AAAI 2011 - San Francisco, United States Duration: 7 Aug 2011 → 11 Aug 2011

Publication series

Name	Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011

Conference

Conference	25th AAAI Conference on Artificial Intelligence, AAAI 2011
Country/Territory	United States
City	San Francisco
Period	7/08/11 → 11/08/11

Bibliographical note

Publisher Copyright:
Copyright © 2011, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Access to Document

10.1609/aaai.v25i1.7842

Cite this

@inproceedings{5bde9c0ae1034fb5ab712a845e964c02,

title = "Bounded Forgetting",

abstract = "The result of forgetting some predicates in a first-order sentence may not exist in the sense that it might not be captured by any first-order sentences. This, indeed, severely restricts the usage of forgetting in applications. To address this issue, we propose a notion called k-forgetting, also called bounded forgetting in general, for any fixed number k. We present several equivalent characterizations of bounded forgetting and show that the result of bounded forgetting, on one hand, can always be captured by a single first-order sentence, and on the other hand, preserves the information that we are concerned with.",

author = "Yi Zhou and Yan Zhang",

note = "Publisher Copyright: Copyright {\textcopyright} 2011, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 25th AAAI Conference on Artificial Intelligence, AAAI 2011 ; Conference date: 07-08-2011 Through 11-08-2011",

year = "2011",

month = aug,

day = "11",

doi = "10.1609/aaai.v25i1.7842",

language = "English",

series = "Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011",

publisher = "AAAI Press",

pages = "280--285",

booktitle = "Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011",

}

TY - GEN

T1 - Bounded Forgetting

AU - Zhou, Yi

AU - Zhang, Yan

PY - 2011/8/11

Y1 - 2011/8/11

N2 - The result of forgetting some predicates in a first-order sentence may not exist in the sense that it might not be captured by any first-order sentences. This, indeed, severely restricts the usage of forgetting in applications. To address this issue, we propose a notion called k-forgetting, also called bounded forgetting in general, for any fixed number k. We present several equivalent characterizations of bounded forgetting and show that the result of bounded forgetting, on one hand, can always be captured by a single first-order sentence, and on the other hand, preserves the information that we are concerned with.

AB - The result of forgetting some predicates in a first-order sentence may not exist in the sense that it might not be captured by any first-order sentences. This, indeed, severely restricts the usage of forgetting in applications. To address this issue, we propose a notion called k-forgetting, also called bounded forgetting in general, for any fixed number k. We present several equivalent characterizations of bounded forgetting and show that the result of bounded forgetting, on one hand, can always be captured by a single first-order sentence, and on the other hand, preserves the information that we are concerned with.

UR - https://www.scopus.com/pages/publications/84863351918

U2 - 10.1609/aaai.v25i1.7842

DO - 10.1609/aaai.v25i1.7842

M3 - Conference Paper

AN - SCOPUS:84863351918

T3 - Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011

SP - 280

EP - 285

BT - Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011

PB - AAAI Press

T2 - 25th AAAI Conference on Artificial Intelligence, AAAI 2011

Y2 - 7 August 2011 through 11 August 2011

ER -

Bounded Forgetting

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this