Preemption Operators (ECAI 2012)

Philippe Besnard (1, 2) , Éric Grégoire (3) , Sébastien Ramon (3)

1 IRIT-LILaC - Logique, Interaction, Langue et Calcul
2 CNRS - Centre National de la Recherche Scientifique
3 CRIL - Centre de Recherche en Informatique de Lens

We introduce a family of operators for belief change that aim at making a new piece of information to be preemptive so that any former belief subsuming it is given up. That is, the current belief base is to be altered even in the case that it is logically consistent with the new piece of information. Existing operators for belief revision are inadequate for this purpose because they amount to settheoretic union in a contradiction-free case.We propose a series of postulates for such preemption operators.We show that a preemption operator can be defined as a multiple contraction followed by an expansion, drawing on operators from belief revision.

Domaines: Intelligence artificielle [cs.AI]

Philippe Besnard, Éric Grégoire, Sébastien Ramon. Preemption Operators (ECAI 2012). 20th European Conference on Artificial Intelligence (ECAI 2012), 2012, Montpellier, France. pp.893-894, ⟨10.3233/978-1-61499-098-7-893⟩. ⟨hal-00867922v2⟩