Generalized DEL-sequents - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Generalized DEL-sequents


Let us consider a sequence of formulas providing partial information about an initial situation, about a set of events occurring sequentially in this situation, and about the resulting situation after the occurrence of each event. From this whole sequence, we want to infer more information, either about the initial situation, or about one of the events, or about the resulting situation after one of the events. Within the framework of Dynamic Epistemic Logic (DEL), we show that these different kinds of problems are all reducible to the problem of inferring what holds in the final situation after the occurrence of all the events. We then provide a tableau method deciding whether this kind of inference is valid. We implement it in LotrecScheme and show that these inference problems are NEXPTIME-complete. We extend our results to the cases where the accessibility relation is serial and reflexive and illustrate them with the coordinated attack problem.
Fichier principal
Vignette du fichier
JELIA2012.pdf (243.81 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-00856472 , version 1 (01-09-2013)


  • HAL Id : hal-00856472 , version 1


Guillaume Aucher, Bastien Maubert, François Schwarzentruber. Generalized DEL-sequents. JELIA - Logics in Artificial Intelligence - 2012, Sep 2013, Toulouse, France. ⟨hal-00856472⟩
333 View
263 Download


Gmail Facebook X LinkedIn More