A Semantic Characterization for ASP Base Revision

Laurent Garcia, Claire Lefèvre, Odile Papini, Igor Stéphan, Éric Würbel

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 characterization allows one to equivalently consider the evolution of syntactic logic programs and the evolution of their semantic content.