A Semantic Characterization ASP Base Revision
Abstract
The paper deals with base revision for Answer Set Programming (ASP). Base revision in classical logic is done by the removal of formulas. Exploiting the non-monotonicity of ASP allows one to propose other revision strategies, namely addition strategy or removal and/or addition strategy. These strategies allow one to define families of rule-based revision operators. The paper presents a semantic characterization of these families of revision operators in terms of answer sets. This semantic characterization allows for equivalently considering the evolution of syntactic logic programs and the evolution of their semantic content. It then studies the logical properties of the proposed operators and gives complexity results.
Cite
Text
Garcia et al. "A Semantic Characterization ASP Base Revision." Journal of Artificial Intelligence Research, 2019. doi:10.1613/JAIR.1.11451Markdown
[Garcia et al. "A Semantic Characterization ASP Base Revision." Journal of Artificial Intelligence Research, 2019.](https://mlanthology.org/jair/2019/garcia2019jair-semantic/) doi:10.1613/JAIR.1.11451BibTeX
@article{garcia2019jair-semantic,
title = {{A Semantic Characterization ASP Base Revision}},
author = {Garcia, Laurent and Lefèvre, Claire and Stéphan, Igor and Papini, Odile and Würbel, Éric},
journal = {Journal of Artificial Intelligence Research},
year = {2019},
pages = {989-1029},
doi = {10.1613/JAIR.1.11451},
volume = {66},
url = {https://mlanthology.org/jair/2019/garcia2019jair-semantic/}
}