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 Twenty-Fifth AAAI Conference on Artificial Intelligence and the Twentry-Third Innovative Applications of Artificial Intelligence: 7-11 August 2011, San Francisco, California, USA |
| Publisher | AAAI Press |
| Pages | 280-285 |
| Number of pages | 6 |
| ISBN (Print) | 9781577355083 |
| Publication status | Published - 2011 |
| Event | AAAI Conference on Artificial Intelligence - Duration: 22 Jul 2012 → … |
Conference
| Conference | AAAI Conference on Artificial Intelligence |
|---|---|
| Period | 22/07/12 → … |