Variable Elimination for DLP-Functions

Research output: Contribution to conferenceAbstractScientificpeer-review

Standard

Variable Elimination for DLP-Functions. / Goncalves, Ricardo; Janhunen, Tomi; Knorr, Matthias; Leite, Joao; Woltran, Stefan.

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

Research output: Contribution to conferenceAbstractScientificpeer-review

Harvard

Goncalves, R, Janhunen, T, Knorr, M, Leite, J & Woltran, S 2018, 'Variable Elimination for DLP-Functions' International Conference on Principles of Knowledge Representation and Reasoning, Tempe, United States, 30/10/2018 - 02/11/2018, pp. 643-644.

APA

Goncalves, R., Janhunen, T., Knorr, M., Leite, J., & Woltran, S. (2018). Variable Elimination for DLP-Functions. 643-644. Abstract from International Conference on Principles of Knowledge Representation and Reasoning, Tempe, United States.

Vancouver

Goncalves R, Janhunen T, Knorr M, Leite J, Woltran S. Variable Elimination for DLP-Functions. 2018. Abstract from International Conference on Principles of Knowledge Representation and Reasoning, Tempe, United States.

Author

Goncalves, Ricardo ; Janhunen, Tomi ; Knorr, Matthias ; Leite, Joao ; Woltran, Stefan. / Variable Elimination for DLP-Functions. Abstract from International Conference on Principles of Knowledge Representation and Reasoning, Tempe, United States.2 p.

Bibtex - Download

@conference{659f5b2e650e4e2dad5c6f633ef6dc44,
title = "Variable Elimination for DLP-Functions",
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.",
keywords = "Answer Set Programming, Forgetting, Modules",
author = "Ricardo Goncalves and Tomi Janhunen and Matthias Knorr and Joao Leite and Stefan Woltran",
year = "2018",
month = "10",
day = "30",
language = "English",
pages = "643--644",
note = "International Conference on Principles of Knowledge Representation and Reasoning, KR ; Conference date: 30-10-2018 Through 02-11-2018",
url = "http://reasoning.eas.asu.edu/kr2018/",

}

RIS - Download

TY - CONF

T1 - Variable Elimination for DLP-Functions

AU - Goncalves, Ricardo

AU - Janhunen, Tomi

AU - Knorr, Matthias

AU - Leite, Joao

AU - Woltran, Stefan

PY - 2018/10/30

Y1 - 2018/10/30

N2 - 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.

AB - 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.

KW - Answer Set Programming

KW - Forgetting

KW - Modules

M3 - Abstract

SP - 643

EP - 644

ER -

ID: 29614073