We address the issue of forgetting in assumption-based argumentation (ABA). Forgetting is
driven by the goal to remove certain elements from a knowledge base, while preserving the …

It is generally agreed upon that so-called strong persistence (SP) captures best the essence
of forgetting in logic programming. While classes of operators, such as FR and FSP, that …

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 …

Abstract Answer Set Programming (ASP) constitutes nowadays one of the most successful
paradigms for practical Knowledge Representation and declarative problem solving. The …

The topic of forgetting has been extensively studied in the field of knowledge representation
and reasoning for many major formalisms. Quite recently it has been introduced to abstract …

The topic of forgetting, which loosely speaking means losing, removing, or even hiding some
variables, propositions, or formulas, has been extensively studied in the field of knowledge …

Answer Set Programming (ASP) is a prominent rule-based language for knowledge
representation and reasoning with roots in logic programming and non-monotonic …

Abstract Forgetting in Answer Set Programming (ASP) aims at reducing the language of a
logic program without affecting the consequences over the remaining language. It has …

Selectively forgetting information while preserving what matters the most is becoming an
increasingly important issue in many areas, including in knowledge representation and …

In this paper, we present a syntactic transformation, called the unfolding operator, that allows
forgetting an atom in a logic program (under ASP semantics). The main advantage of …