English

Forgetting in Answer Set Programming -- A Survey

Artificial Intelligence 2021-12-08 v3 Logic in Computer Science

Abstract

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

Keywords

Cite

@article{arxiv.2107.07016,
  title  = {Forgetting in Answer Set Programming -- A Survey},
  author = {Ricardo Gonçalves and Matthias Knorr and João Leite},
  journal= {arXiv preprint arXiv:2107.07016},
  year   = {2021}
}

Comments

Under consideration in Theory and Practice of Logic Programming (TPLP)

R2 v1 2026-06-24T04:12:37.960Z