Journal articles
A Semantic Characterization for 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.
Cited literature [61 references]
https://hal-amu.archives-ouvertes.fr/hal-02392942
Contributor : Éric Würbel Connect in order to contact the contributor
Submitted on : Wednesday, December 4, 2019 - 10:57:11 AM
Last modification on : Wednesday, November 3, 2021 - 9:46:48 AM
Long-term archiving on: : Thursday, March 5, 2020 - 4:03:06 PM
Contributor : Éric Würbel Connect in order to contact the contributor
Submitted on : Wednesday, December 4, 2019 - 10:57:11 AM
Last modification on : Wednesday, November 3, 2021 - 9:46:48 AM
Long-term archiving on: : Thursday, March 5, 2020 - 4:03:06 PM