A Semantic characterization for ASP base revision

Laurent Garcia (1) , Claire Lefevre , Odile Papini (2, 3) , Igor Stephan (1) , Eric Würbel (2, 3)

1 LERIA - Laboratoire d'Etudes et de Recherche en Informatique d'Angers
2 LIS - Laboratoire d'Informatique et des Systèmes (LIS) (Marseille, Toulon)
3 LIRICA - Logique, Interaction, Raisonnement et Inférence, Complexité, Algèbre

The paper deals with base revision for Answer Set Programming (ASP). Base revision in classical logic stems from 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.

Mots clés: Answer Set Programming; Base revision; Belief revision; Belief change; Non-monotonic reasoning

Domaines: Intelligence artificielle [cs.AI]; Logique en informatique [cs.LO]; Complexité [cs.CC]

Laurent Garcia, Claire Lefevre, Odile Papini, Igor Stephan, Eric Würbel. A Semantic characterization for ASP base revision. Scalable Uncertainty Management, Oct 2017, Granada, Spain. pp.334--347. ⟨hal-01770946⟩