Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Possibilistic ASP Base Revision by Certain Input

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

Cited literature [21 references]  Display  Hide  Download
Contributor : Éric Würbel Connect in order to contact the contributor
Submitted on : Thursday, May 17, 2018 - 2:36:03 PM
Last modification on : Sunday, June 26, 2022 - 10:27:27 AM
Long-term archiving on: : Tuesday, September 25, 2018 - 2:57:44 PM


Files produced by the author(s)


  • HAL Id : hal-01794353, version 1


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⟩



Record views


Files downloads