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 metadatas

Cited literature [33 references]  Display  Hide  Download

https://hal-amu.archives-ouvertes.fr/hal-01770946
Contributor : Éric Würbel <>
Submitted on : Thursday, April 19, 2018 - 11:15:57 AM
Last modification on : Friday, September 25, 2020 - 8:25:59 AM
Long-term archiving on: : Tuesday, September 18, 2018 - 1:21:44 PM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01770946, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

239

Files downloads

312