Abstract
Forgetting, or the elimination of middle variables no longer deemed relevant, has recently gained considerable interest in the context of Answer Set Programming (ASP), notably due to the formalization of strong persistence, a property based on strong equivalence between the program and the result of forgetting modulo the atoms being eliminated, which seems to adequately encode the requirements of the forgetting operation. Whereas it has been shown that in general, in ASP, it is not always possible to forget and obey strong persistence, the structure of modules in the form of DLP-functions, namely their restricted interface, invites the investigation of a weaker notion of persistence based on uniform equivalence.
| Original language | English |
|---|---|
| Pages | 643-644 |
| Number of pages | 2 |
| Publication status | Published - 30 Oct 2018 |
| MoE publication type | Not Eligible |
| Event | International Conference on Principles of Knowledge Representation and Reasoning - Tempe, United States Duration: 30 Oct 2018 → 2 Nov 2018 Conference number: 16 http://reasoning.eas.asu.edu/kr2018/ |
Conference
| Conference | International Conference on Principles of Knowledge Representation and Reasoning |
|---|---|
| Abbreviated title | KR |
| Country/Territory | United States |
| City | Tempe |
| Period | 30/10/2018 → 02/11/2018 |
| Internet address |
Keywords
- Answer Set Programming
- Forgetting
- Modules