TY - GEN
T1 - Bounded forgetting
AU - Zhou, Yi
AU - Zhang, Yan
PY - 2011
Y1 - 2011
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
SN - 9781577355083
T3 - Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011
SP - 280
EP - 285
BT - Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence and the Twentry-Third Innovative Applications of Artificial Intelligence: 7-11 August 2011, San Francisco, California, USA
PB - AAAI Press
T2 - 25th AAAI Conference on Artificial Intelligence, AAAI 2011
Y2 - 7 August 2011 through 11 August 2011
ER -