# A Syntactic Operator for Forgetting that Satisfies Strong Persistence

arXiv: https://arxiv.org/abs/1907.12501 · HTML: https://mlsanity.com/paper/1907.12501/

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 29 Jul 2019.

## Built on by (most cited first, 4 of 4)

- [Forgetting in Answer Set Programming -- A Survey](https://mlsanity.com/paper/2107.07016/) (2021)
- [A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming](https://mlsanity.com/paper/2312.07993/) (2023)
- [Four algorithms for propositional forgetting](https://mlsanity.com/paper/2204.06528/) (2022)
- [Interpolation in Knowledge Representation](https://mlsanity.com/paper/2512.08833/) (2025)

## Abstract (arXiv)

Whereas the operation of forgetting has recently seen a considerable amount of attention in the context of Answer Set Programming (ASP), most of it has focused on theoretical aspects, leaving the practical issues largely untouched. Recent studies include results about what sets of properties operators should satisfy, as well as the abstract characterization of several operators and their theoretical limits. However, no concrete operators have been investigated. In this paper, we address this issue by presenting the first concrete operator that satisfies strong persistence - a property that seems to best capture the essence of forgetting in the context of ASP - whenever this is possible, and many other important properties. The operator is syntactic, limiting the computation of the forgetting result to manipulating the rules in which the atoms to be forgotten occur, naturally yielding a forgetting result that is close to the original program. This paper is under consideration for acceptance in TPLP.