Possibilistic ASP Base Revision by Certain Input - Archive ouverte HAL Access content directly
Conference Papers Year :

Possibilistic ASP Base Revision by Certain Input

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

Abstract

Belief base revision has been studied within the answer set programming framework. We go a step further by introducing uncertainty and studying belief base revision when beliefs are represented by possibilistic logic programs under possibilistic answer set semantics and revised by certain input. The paper proposes two approaches of rule-based revision operators and presents their semantic characterization in terms of possibilistic distribution. 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.
Fichier principal
Vignette du fichier
main.pdf (237.44 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01794353 , version 1 (17-05-2018)

Identifiers

  • HAL Id : hal-01794353 , version 1

Cite

Laurent Garcia, Claire Lefèvre, Odile Papini, Igor Stephan, Eric Würbel. Possibilistic ASP Base Revision by Certain Input. International Joint Conference on Artificial Intelligence, Jul 2018, Stockholm, Sweden. ⟨hal-01794353⟩
125 View
97 Download

Share

Gmail Facebook Twitter LinkedIn More