# A Brief History of Updates of Answer-Set Programs

arXiv: https://arxiv.org/abs/2112.13477 · HTML: https://mlsanity.com/paper/2112.13477/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 2 of its 94 references that are in the map.
- First posted on arXiv 27 Dec 2021.

## Builds on (most cited first, 2 of 2)

- [Characterization of Logic Program Revision as an Extension of Propositional Revision](https://mlsanity.com/paper/1506.08919/) (2015)
- [Syntax-Preserving Belief Change Operators for Logic Programs](https://mlsanity.com/paper/1703.04912/) (2017)

## Built on by (most cited first, 1 of 1)

- [On Strong Equivalence Notions in Logic Programming and Abstract Argumentation](https://mlsanity.com/paper/2605.14721/) (2026)

## Abstract (arXiv)

Over the last couple of decades, there has been a considerable effort devoted to the problem of updating logic programs under the stable model semantics (a.k.a. answer-set programs) or, in other words, the problem of characterising the result of bringing up-to-date a logic program when the world it describes changes. Whereas the state-of-the-art approaches are guided by the same basic intuitions and aspirations as belief updates in the context of classical logic, they build upon fundamentally different principles and methods, which have prevented a unifying framework that could embrace both belief and rule updates. In this paper, we will overview some of the main approaches and results related to answer-set programming updates, while pointing out some of the main challenges that research in this topic has faced.