A Semantic characterization for ASP base revision - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

A Semantic characterization for ASP base revision

(1) , , (2, 3) , (1) , (2, 3)
1
2
3

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.
Fichier principal
Vignette du fichier
main.pdf (281.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01770946 , version 1 (19-04-2018)

Identifiers

  • HAL Id : hal-01770946 , version 1

Cite

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⟩
238 View
308 Download

Share

Gmail Facebook Twitter LinkedIn More