Forgetting in Answer Set Programming – A Survey

by   Ricardo Gonçalves, et al.

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 somehow 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.



page 1

page 2

page 3

page 4


A Syntactic Operator for Forgetting that Satisfies Strong Persistence

Whereas the operation of forgetting has recently seen a considerable amo...

When You Must Forget: beyond strong persistence when forgetting in answer set programming

Among the myriad of desirable properties discussed in the context of for...

A Forgetting-based Approach to Merging Knowledge Bases

This paper presents a novel approach based on variable forgetting, which...

Computing with Logic as Operator Elimination: The ToyElim System

A prototype system is described whose core functionality is, based on pr...

Forgetting Formulas and Signature Elements in Epistemic States

Delgrande's knowledge level account of forgetting provides a general app...

On Forgetting in Tractable Propositional Fragments

Distilling from a knowledge base only the part that is relevant to a sub...

On Sufficient and Necessary Conditions in Bounded CTL

Computation Tree Logic (CTL) is one of the central formalisms in formal ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.