Forgetting in Answer Set Programming -- A Survey
Not on the map. Why?
Abstract (arXiv)
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 paper, 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.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 6 of its 104 references that are in the map. First posted on arXiv 14 Jul 2021.
Builds on
6 of 104 references.
References · 6
- 2014Modularity Aspects of Disjunctive Stable Modelscited by 8
- 2020Omission-based Abstraction for Answer Set Programscited by 7
- 2019A Syntactic Operator for Forgetting that Satisfies Strong Persistencecited by 4
- 2017When You Must Forget: beyond strong persistence when forgetting in answer set programmingcited by 3
- 2014Interpolable Formulas in Equilibrium Logic and Answer Set Programmingcited by 2
- 2014The Logical Difference for the Lightweight Description Logic ELcited by 2
Built on by
Citing papers per year: 2022: 1; 2023: 2; 2024: 1; 2025: 1.
5 papers.
- 2023Dual Forgetting Operators in the Context of Weakest Sufficient and Strongest Necessary Conditionscited by 1
- 2023A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programmingcited by 1
- 2022Abductive forgettingcited by 0
- 2024Techniques for Measuring the Inferential Strength of Forgetting Policiescited by 0
- 2025Interpolation in Knowledge Representationcited by 0
- 2025Interpolation in Knowledge Representation9 Dec 2025
- 2024Techniques for Measuring the Inferential Strength of Forgetting Policies3 Apr 2024
- 2023A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming13 Dec 2023
- 2023Dual Forgetting Operators in the Context of Weakest Sufficient and Strongest Necessary Conditions12 May 2023
- 2022Abductive forgetting26 Sep 2022