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 metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal-amu.archives-ouvertes.fr/hal-01794353
Contributor : Éric Würbel <>
Submitted on : Thursday, May 17, 2018 - 2:36:03 PM
Last modification on : Friday, May 10, 2019 - 12:50:14 PM
Long-term archiving on : Tuesday, September 25, 2018 - 2:57:44 PM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01794353, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

96

Files downloads

94