Variable Elimination for DLP-Functions

to determine whether the semantics of the program w. r. t. 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.

Authors

• Ricardo Gonçalves
• Tomi Janhunen
• Matthias Knorr
• Joao Leite
• Stefan Woltran TU Wien

Keywords

No keywords are indexed for this paper.