A bird’s-eye view of forgetting in answer-set programming. (English) Zbl 1491.68218

Balduccini, Marcello (ed.) et al., Logic programming and nonmonotonic reasoning. 14th international conference, LPNMR 2017, Espoo, Finland, July 3–6, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10377, 10-22 (2017).
Summary: Forgetting is an operation that allows the removal, from a knowledge base, of middle variables no longer deemed relevant, while preserving all relationships (direct and indirect) between the remaining variables. When investigated in the context of answer-set programming, many different approaches to forgetting have been proposed, following different intuitions, and obeying different sets of properties.
This talk will present a bird’s-eye view of the complex landscape composed of the properties and operators of forgetting defined over the years in the context of answer-set programming, zooming in on recent findings triggered by the formulation of the so-called strong persistence, a property based on the strong equivalence between an answer-set program and the result of forgetting modulo the forgotten atoms, which seems to best encode the requirements of the forgetting operation.
For the entire collection see [Zbl 1367.68005].


68T30 Knowledge representation
68N17 Logic programming
Full Text: DOI