Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aucher, G.: An internal version of epistemic logic. Studia Logica 94(1), 1–22 (2010)
Aucher, G.: DEL-sequents for regression and epistemic planning. Journal of Applied Non-Classical Logics (to appear, 2012)
Aucher, G., Maubert, B., Schwarzentruber, F.: Tableau method and NEXPTIME-completeness of DEL-sequents. Electronic Notes in Theoretical Computer Science 278, 17–30 (2011)
Balbiani, P., van Ditmarsch, H., Herzig, A., de Lima, T.: Tableaux for public announcement logic. Journal of Logic and Computation 20(1), 55–76 (2010)
Baltag, A., Coecke, B., Sadrzadeh, M.: Algebra and sequent calculus for epistemic actions. In: Proceedings of Workshop on Logic and Communication in Multi-Agent Systems (LCMAS 2004), pp. 60–78 (2004)
Baltag, A., Moss, L.: Logic for epistemic programs. Synthese 139(2), 165–224 (2004)
Baltag, A., Moss, L., Solecki, S.: The logic of common knowledge, public announcement, and private suspicions. In: Gilboa, I. (ed.) Proceedings of the 7th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 1998), pp. 43–56 (1998)
Baltag, A., Moss, L., Solecki, S.: The logic of public announcements, common knowledge and private suspicions. Technical report, Indiana University (1999)
Booth, R., Nittka, A.: Reconstructing an agent’s epistemic state from observations about its beliefs and non-beliefs. J. Log. Comput. 18(5), 755–782 (2008)
Brusoni, V., Console, L., Terenziani, P., Dupré, D.T.: A spectrum of definitions for temporal model-based diagnosis. Artificial Intelligence 102(1), 39–79 (1998)
de Boer, M.: KE tableaux for public anouncement logic. In: Proceedings of Formal Approaches to Multi-Agent Systems Workshop (FAMAS 2007), Durham, UK (2007)
de Saint-Cyr, F.D., Lang, J.: Belief extrapolation (or how to reason about observations and unpredicted change). Artif. Intell. 175(2), 760–790 (2011)
Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning about knowledge. MIT Press (1995)
Hansen, J.U.: Terminating tableaux for dynamic epistemic logic. Electronic Notes in Theoretical Computer Science 262, 141–156 (2010)
Maffezioli, P., Negri, S.: A gentzen-style analysis of public announcement logic. In: Proceedings of the International Workshop on Logic and Philosophy of Knowledge, Communication and Action, pp. 293–313 (2010)
Schwarzentruber, F.: Lotrecscheme. Electronic Notes in Theoretical Computer Science 278, 187–199 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aucher, G., Maubert, B., Schwarzentruber, F. (2012). Generalized DEL-Sequents. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds) Logics in Artificial Intelligence. JELIA 2012. Lecture Notes in Computer Science(), vol 7519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33353-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-33353-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33352-1
Online ISBN: 978-3-642-33353-8
eBook Packages: Computer ScienceComputer Science (R0)