# A Syntactic Operator for Forgetting that Satisfies Strong Persistence

## TL;DR

This paper introduces the first concrete syntactic operator for forgetting in Answer Set Programming that satisfies strong persistence and other key properties, bridging theoretical foundations with practical computation.

## Contribution

It presents a novel syntactic operator for forgetting in ASP that satisfies strong persistence, addressing a gap between theory and practical implementation.

## Key findings

- Operator satisfies strong persistence and other properties
- Computationally efficient by manipulating relevant rules
- Produces results close to the original program

## Abstract

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.