TY - JOUR
T1 - Forgetting in Answer Set Programming - A Survey
AU - Gonçalves, Ricardo
AU - Knorr, Matthias
AU - Leite, João
N1 - info:eu-repo/grantAgreement/FCT/6817 - DCRRNI ID/UIDB%2F04516%2F2020/PT#
We thank the anonymous reviewers for their helpful comments. This work was partially supported by FCT project FORGET (PTDC/CCI-INF/32219/2017)
PY - 2023/1
Y1 - 2023/1
N2 - Forgetting - or variable elimination - is an operation that allows the removal, from a knowledge base, of middle variables no longer deemed relevant. In recent years, many different approaches for forgetting in Answer Set Programming have been proposed, in the form of specific operators, or classes of such operators, commonly following different principles and obeying different properties. Each such approach was developed to address some particular view on forgetting, aimed at obeying a specific set of properties deemed desirable in such view, but a comprehensive and uniform overview of all the existing operators and properties is missing. In this article, we thoroughly examine existing properties and (classes of) operators for forgetting in Answer Set Programming, drawing a complete picture of the landscape of these classes of forgetting operators, which includes many novel results on relations between properties and operators, including considerations on concrete operators to compute results of forgetting and computational complexity. Our goal is to provide guidance to help users in choosing the operator most adequate for their application requirements.
AB - Forgetting - or variable elimination - is an operation that allows the removal, from a knowledge base, of middle variables no longer deemed relevant. In recent years, many different approaches for forgetting in Answer Set Programming have been proposed, in the form of specific operators, or classes of such operators, commonly following different principles and obeying different properties. Each such approach was developed to address some particular view on forgetting, aimed at obeying a specific set of properties deemed desirable in such view, but a comprehensive and uniform overview of all the existing operators and properties is missing. In this article, we thoroughly examine existing properties and (classes of) operators for forgetting in Answer Set Programming, drawing a complete picture of the landscape of these classes of forgetting operators, which includes many novel results on relations between properties and operators, including considerations on concrete operators to compute results of forgetting and computational complexity. Our goal is to provide guidance to help users in choosing the operator most adequate for their application requirements.
KW - Answer set programming
KW - Forgetting
KW - Logic programs
UR - http://www.scopus.com/inward/record.url?scp=85122096054&partnerID=8YFLogxK
U2 - 10.1017/S1471068421000570
DO - 10.1017/S1471068421000570
M3 - Article
AN - SCOPUS:85122096054
SN - 1471-0684
VL - 23
SP - 111
EP - 156
JO - Theory and Practice of Logic Programming
JF - Theory and Practice of Logic Programming
IS - 1
ER -