Variable Elimination for DLP-Functions

Ricardo Gonçalves, Tomi Janhunen, Matthias Knorr, João Leite, Stefan Woltran

Research output: Contribution to conferenceAbstract

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 languageEnglish
Pages643-644
Number of pages2
Publication statusPublished - 2018
Event16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018) - Tempe, United States
Duration: 27 Oct 20182 Nov 2018

Conference

Conference16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018)
CountryUnited States
CityTempe
Period27/10/182/11/18

Fingerprint

persistence
programme

Keywords

  • Answer Set Programming
  • Forgetting
  • Modules

Cite this

Gonçalves, R., Janhunen, T., Knorr, M., Leite, J., & Woltran, S. (2018). Variable Elimination for DLP-Functions. 643-644. Abstract from 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), Tempe, United States.
Gonçalves, Ricardo ; Janhunen, Tomi ; Knorr, Matthias ; Leite, João ; Woltran, Stefan. / Variable Elimination for DLP-Functions. Abstract from 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), Tempe, United States.2 p.
@conference{f085e8d9a6e148668bb891a3dc76e1a5,
title = "Variable Elimination for DLP-Functions",
abstract = "Forgetting, or the elimination of middle variables no longerdeemed relevant, has recently gained considerable interest inthe context of Answer Set Programming (ASP), notably dueto the formalization of strong persistence, a property basedon strong equivalence between the program and the result offorgetting modulo the atoms being eliminated, which seemsto adequately encode the requirements of the forgetting operation. Whereas it has been shown that in general, in ASP, it isnot always possible to forget and obey strong persistence, thestructure of modules in the form of DLP-functions, namelytheir restricted interface, invites the investigation of a weakernotion of persistence based on uniform equivalence.",
keywords = "Answer Set Programming, Forgetting, Modules",
author = "Ricardo Gon{\cc}alves and Tomi Janhunen and Matthias Knorr and Jo{\~a}o Leite and Stefan Woltran",
note = "info:eu-repo/grantAgreement/FCT/5876/147279/PT# R. Gonc¸alves, M. Knorr, and J. Leite were partially supported by FCT project FORGET (PTDC/CCI-INF/32219/2017) and by FCT project NOVA LINCS (UID/CEC/04516/2013). T. Janhunen was partially supported by the Academy of Finland grant 251170. R. Gonc¸alves was partially supported by FCT grant SFRH/BPD/100906/2014. S. Woltran was supported by the Austrian Science Fund (FWF): Y698, P25521. Extended abstract published in Proceedings of the Sixteenth International Conference on Principles of Knowledge.Representation and Reasoning (KR 2018); 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018) ; Conference date: 27-10-2018 Through 02-11-2018",
year = "2018",
language = "English",
pages = "643--644",

}

Gonçalves, R, Janhunen, T, Knorr, M, Leite, J & Woltran, S 2018, 'Variable Elimination for DLP-Functions' 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), Tempe, United States, 27/10/18 - 2/11/18, pp. 643-644.

Variable Elimination for DLP-Functions. / Gonçalves, Ricardo; Janhunen, Tomi; Knorr, Matthias; Leite, João; Woltran, Stefan.

2018. 643-644 Abstract from 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), Tempe, United States.

Research output: Contribution to conferenceAbstract

TY - CONF

T1 - Variable Elimination for DLP-Functions

AU - Gonçalves, Ricardo

AU - Janhunen, Tomi

AU - Knorr, Matthias

AU - Leite, João

AU - Woltran, Stefan

N1 - info:eu-repo/grantAgreement/FCT/5876/147279/PT# R. Gonc¸alves, M. Knorr, and J. Leite were partially supported by FCT project FORGET (PTDC/CCI-INF/32219/2017) and by FCT project NOVA LINCS (UID/CEC/04516/2013). T. Janhunen was partially supported by the Academy of Finland grant 251170. R. Gonc¸alves was partially supported by FCT grant SFRH/BPD/100906/2014. S. Woltran was supported by the Austrian Science Fund (FWF): Y698, P25521. Extended abstract published in Proceedings of the Sixteenth International Conference on Principles of Knowledge.Representation and Reasoning (KR 2018)

PY - 2018

Y1 - 2018

N2 - Forgetting, or the elimination of middle variables no longerdeemed relevant, has recently gained considerable interest inthe context of Answer Set Programming (ASP), notably dueto the formalization of strong persistence, a property basedon strong equivalence between the program and the result offorgetting modulo the atoms being eliminated, which seemsto adequately encode the requirements of the forgetting operation. Whereas it has been shown that in general, in ASP, it isnot always possible to forget and obey strong persistence, thestructure of modules in the form of DLP-functions, namelytheir restricted interface, invites the investigation of a weakernotion of persistence based on uniform equivalence.

AB - Forgetting, or the elimination of middle variables no longerdeemed relevant, has recently gained considerable interest inthe context of Answer Set Programming (ASP), notably dueto the formalization of strong persistence, a property basedon strong equivalence between the program and the result offorgetting modulo the atoms being eliminated, which seemsto adequately encode the requirements of the forgetting operation. Whereas it has been shown that in general, in ASP, it isnot always possible to forget and obey strong persistence, thestructure of modules in the form of DLP-functions, namelytheir restricted interface, invites the investigation of a weakernotion of persistence based on uniform equivalence.

KW - Answer Set Programming

KW - Forgetting

KW - Modules

M3 - Abstract

SP - 643

EP - 644

ER -

Gonçalves R, Janhunen T, Knorr M, Leite J, Woltran S. Variable Elimination for DLP-Functions. 2018. Abstract from 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), Tempe, United States.