A Semantic Characterization for ASP Base Revision

Laurent Garcia (1) , Claire Lefèvre (1) , Igor Stéphan (1) , Odile Papini (2) , Eric Würbel (2)

1 LERIA - Laboratoire d'Etudes et de Recherche en Informatique d'Angers
2 LIS - Laboratoire d'Informatique et Systèmes

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.

Domains: Computer Science [cs]; Artificial Intelligence [cs.AI]; Computer Science [cs]; Logic in Computer Science [cs.LO]; Computer Science [cs]; Computational Complexity [cs.CC]

Laurent Garcia, Claire Lefèvre, Igor Stéphan, Odile Papini, Eric Würbel. A Semantic Characterization for ASP Base Revision. Journal of Artificial Intelligence Research, 2019, 66, pp.989 - 1029. ⟨hal-02392942⟩