Abstract
Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then extended with a collection of operations to access and modify the data structure. In this paper we study their satisfiability and the model checking problems.
We first give sound and complete tableaux calculi for the memory logic \(\mathcal {ML}\)(ⓚ, ⓡ, ⓔ) (the basic modal language extended with the operator ⓡ used to memorize a state, the operator ⓔ used to wipe out the memory, and the operator ⓚ used to check if the current point of evaluation is memorized) and some of its sublanguages. As the satisfiability problem of \(\mathcal {ML}\)(ⓚ, ⓡ, ⓔ) is undecidable, the tableau calculus we present is non terminating. Hence, we furthermore study a variation that ensures termination, at the expense of completeness, and we use model checking to ensure soundness. Secondly, we show that the model checking problem is PSpace-complete.
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
Areces, C.: Hybrid logics: The old and the new. In: Proc. of LogKCA 2007. San Sebastian, Spain (2007)
Areces, C., Figueira, D., Figueira, S., Mera, S.: Expressive power and decidability for memory logics. In: Hodges, W., de Queiroz, R. (eds.) Logic, Language, Information and Computation. LNCS, vol. 5110, pp. 56–68. Springer, Heidelberg (2008)
Areces, C., Figueira, D., Figueira, S., Mera, S.: Expressive power and decidability for memory logics. Technical report, INRIA Nancy, Grand Est. (2008); Extended version of [2]
Areces, C., Figueira, S., Mera, S.: Completeness results for memory logics. In: LFCS 2009. LNCS, vol. 5407. Springer, Heidelberg (2009)
Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)
Blackburn, P., Wolter, F., van Benthem, J. (eds.): Handbook of Modal Logics. Elsevier, Amsterdam (2006)
Areces, C., ten Cate, B.: Hybrid logics. In: [6], pp. 821–868
van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Kluwer Academic Publishers, Dordrecht (2007)
Harel, E., Lichtenstein, O., Pnueli, A.: Explicit clock temporal logic. In: Proc. of LICS 1990, pp. 402–413 (1990)
Plaza, J.: Logics of public communications. In: Proc. of 4th International Symp. on Methodologies for Intelligent Systems, pp. 201–216 (1989)
van Benthem, J.: Logics for information update. In: Proc. of TARK 2001, pp. 51–67. Morgan Kaufmann Pub., San Francisco (2001)
van Benthem, J., van Eijck, J., Kooi, B.: Logics of communication and change. Information and Computation 204(11), 1620–1662 (2006)
Chandra, A., Merlin, P.: Optimal implementation of conjunctive queries in relational databases. In: Proc. of 9th ACM Symp. on Theory of Computing, pp. 77–90 (1977)
Bolander, T., Blackburn, P.: Termination for hybrid tableaus. Journal of Logic and Computation 17, 517–554 (2007)
Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)
Franceschet, M., de Rijke, M.: Model checking hybrid logics (with an application to semistructured data). Journal of Applied Logic 4(3), 279–304 (2006)
Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Areces, C., Figueira, D., Gorín, D., Mera, S. (2009). Tableaux and Model Checking for Memory Logics. In: Giese, M., Waaler, A. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2009. Lecture Notes in Computer Science(), vol 5607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02716-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-02716-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02715-4
Online ISBN: 978-3-642-02716-1
eBook Packages: Computer ScienceComputer Science (R0)