A carregar...
Publicação
A Brief History of Updates of Answer-Set Programs
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 738.62 KB | Adobe PDF |
Autores
Orientador(es)
Resumo(s)
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.
Descrição
Funding Information:
The authors would like to thank José Alferes, Martin Baláz, Federico Banti, Antonio Brogi, Martin Homola, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski, and Theresa Swift, with whom they worked on the topic of this paper over the years, as well as Ricardo Gonçalves and Matthias Knorr for valuable comments on an earlier draft of this paper. The authors would also like to thank the anonymous reviewers for their insightful comments and suggestions, which greatly helped us improve this paper.
Publisher Copyright:
© The Author(s), 2022. Published by Cambridge University Press.
Palavras-chave
answer-set programming belief change belief update KEYWORDS: logic programming Software Theoretical Computer Science Hardware and Architecture Computational Theory and Mathematics Artificial Intelligence