In this paper, we develop a notion of forgetting for normal logic programs under the well-founded semantics. We show that a number of desirable properties are satisfied by our approach. Three different algorithms are presented that maintain the computational complexity of the well-founded semantics, while partly keeping its syntactical structure.
|Title of host publication||Lecture Notes in Computer Science|
|Publication status||Published - 1 Jan 2013|
|Event||12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR) - |
Duration: 1 Jan 2013 → …
|Conference||12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)|
|Period||1/01/13 → …|