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.
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 - 2018 |
| Event | 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018) - Tempe, United States Duration: 27 Oct 2018 → 2 Nov 2018 |
Conference
| Conference | 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018) |
|---|---|
| Country/Territory | United States |
| City | Tempe |
| Period | 27/10/18 → 2/11/18 |
Keywords
- Answer Set Programming
- Forgetting
- Modules