HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

A Semantic characterization for ASP base revision

Abstract : 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.
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download

Contributor : Éric Würbel Connect in order to contact the contributor
Submitted on : Thursday, April 19, 2018 - 11:15:57 AM
Last modification on : Wednesday, November 3, 2021 - 5:49:48 AM
Long-term archiving on: : Tuesday, September 18, 2018 - 1:21:44 PM


Files produced by the author(s)


  • HAL Id : hal-01770946, version 1



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⟩



Record views


Files downloads