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 …

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 …

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 …

Abstraction is a well-known approach to simplify a complex problem by over-approximating
it with a deliberate loss of information. It was not considered so far in Answer Set …

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 …

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 …

Modular programming facilitates the creation and reuse of large software, and has recently
gathered considerable interest in the context of Answer Set Programming (ASP). In this …

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

Forgetting variables from a propositional formula may increase its size. Introducing new
variables is a way to shorten it. Both operations can be expressed in terms of common …