Variable Elimination for DLP-Functions

Ricardo Goncalves, Tomi Janhunen, Matthias Knorr, Joao Leite, Stefan Woltran

Research output: Contribution to conferenceAbstractScientificpeer-review


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 languageEnglish
Number of pages2
Publication statusPublished - 30 Oct 2018
MoE publication typeNot Eligible
EventInternational Conference on Principles of Knowledge Representation and Reasoning - Tempe, United States
Duration: 30 Oct 20182 Nov 2018
Conference number: 16


ConferenceInternational Conference on Principles of Knowledge Representation and Reasoning
Abbreviated titleKR
Country/TerritoryUnited States
Internet address


  • Answer Set Programming
  • Forgetting
  • Modules


Dive into the research topics of 'Variable Elimination for DLP-Functions'. Together they form a unique fingerprint.

Cite this