Possibilistic ASP Base Revision by Certain Input

Laurent Garcia (1) , Claire Lefèvre (1) , Odile Papini (2, 3) , Igor Stephan (1) , Eric Würbel (2, 3)

1 LERIA - Laboratoire d'Etudes et de Recherche en Informatique d'Angers
2 LIS - Laboratoire d'Informatique et des Systèmes (LIS) (Marseille, Toulon)
3 LIRICA - Logique, Interaction, Raisonnement et Inférence, Complexité, Algèbre

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.

Domaines: Intelligence artificielle [cs.AI]; Logique en informatique [cs.LO]; Complexité [cs.CC]

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⟩