Abstract:
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structures. In this paper we present sound and complete axiomatizations for some members of this family. We analyze the use of nominals to achieve completeness, and present one example in which they can be avoided. © 2011 Elsevier B.V.
Referencias:
- Alur, R., Henzinger, T., A really temporal logic (1989) Journal of the ACM, pp. 164-169. , IEEE Computer Society Press
- Areces, C., Hybrid logics: the old and the new (2007), pp. 15-29. , Proceedings of LogKCA-07, San Sebastian, Spain; Areces, C., Figueira, D., Figueira, S., Mera, S., Expressive power and decidability for memory logics (2008) LNCS, 5110, pp. 56-68. , Springer, Berlin, Heidelberg, Logic, Language, Information and Computation
- Areces, C., Figueira, D., Figueira, S., Mera, S., The expressive power of memory logics (2011) The Review of Symbolic Logic, 4 (2), pp. 290-318
- Areces, C., ten Cate, B., , (9), pp. 821-868. , Hybrid logics, in: Blackburn et al; Blackburn, P., Representation, reasoning, and relational structures: a hybrid logic manifesto (2000) Logic Journal of the IGPL, 8 (3), pp. 339-625
- Blackburn, P., de Rijke, M., Venema, Y., (2001) Modal Logic, , Cambridge University Press
- Blackburn, P., Tzakova, M., Hybrid completeness (1998) Logic Journal of the IGPL, 6 (4), pp. 625-650
- (2006) Handbook of Modal Logics, , Elsevier, P. Blackburn, F. Wolter, J. van Benthem (Eds.)
- Gerbrandy, J., Bisimulations on planet Kripke (1999), Ph.D. Thesis, University of Amsterdam, iLLC Dissertation series DS-1999-01; Harel, E., Lichtenstein, O., Pnueli, A., Explicit clock temporal logic (1990) Proceedings of LICS'90., pp. 402-413
- Henzinger, T., Half-order modal logic: how to prove real-time properties (1990) Proceedings of the Ninth Annual Symposium on Principles of Distributed Computing, pp. 281-296. , ACM Press
- Lutz, C., The complexity of reasoning with concrete domains (2002), Ph.D. Thesis, LuFG Theoretical Computer Science, RWTH Aachen, Germany; Plaza, J., Logics of public communications (1989) 4th International Symposium on Methodologies for Intelligent Systems., pp. 201-216
- van Benthem, J., Logics for information update (2001) TARK'01: Proceedings of the 8th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 51-67. , Morgan Kaufmann Publishers Inc
- van Benthem, J., van Eijck, J., Kooi, B., Logics of communication and change (2006) Information and Computation, 204 (11), pp. 1620-1662
- van Ditmarsch, H., van der Hoek, W., Kooi, B., (2007) Dynamic Epistemic Logic, , Kluwer academic publishers
Citas:
---------- APA ----------
Areces, C., Figueira, S. & Mera, S.
(2012)
. Completeness results for memory logics. Annals of Pure and Applied Logic, 163(7), 961-972.
http://dx.doi.org/10.1016/j.apal.2011.09.005---------- CHICAGO ----------
Areces, C., Figueira, S., Mera, S.
"Completeness results for memory logics"
. Annals of Pure and Applied Logic 163, no. 7
(2012) : 961-972.
http://dx.doi.org/10.1016/j.apal.2011.09.005---------- MLA ----------
Areces, C., Figueira, S., Mera, S.
"Completeness results for memory logics"
. Annals of Pure and Applied Logic, vol. 163, no. 7, 2012, pp. 961-972.
http://dx.doi.org/10.1016/j.apal.2011.09.005---------- VANCOUVER ----------
Areces, C., Figueira, S., Mera, S. Completeness results for memory logics. Ann. Pure Appl. Logic. 2012;163(7):961-972.
http://dx.doi.org/10.1016/j.apal.2011.09.005