Navegar

Colección

Datos Estadísticas

Artículo

Areces, C.; Figueira, S.; Mera, S. "Completeness results for memory logics" (2009) International Symposium on Logical Foundations of Computer Science, LFCS 2009. 5407 LNCS:16-30
La versión final de este artículo es de uso interno. El editor solo permite incluir en el repositorio el artículo en su versión post-print. Por favor, si usted la posee enviela a
Consulte el artículo en la página del editor
Consulte la política de Acceso Abierto del editor

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. © Springer-Verlag Berlin Heidelberg 2009.

Registro:

Documento: Artículo
Título:Completeness results for memory logics
Autor:Areces, C.; Figueira, S.; Mera, S.
Ciudad:Deerfield Beach, FL
Filiación:INRIA Nancy Grand Est, France
Departamento de Computación, FCEyN, UBA, Argentina
CONICET, Argentina
Palabras clave:Complete axiomatizations; Modal logic; Relational structures; Data structures; Computer science
Año:2009
Volumen:5407 LNCS
Página de inicio:16
Página de fin:30
DOI: http://dx.doi.org/10.1007/978-3-540-92687-0_2
Título revista:International Symposium on Logical Foundations of Computer Science, LFCS 2009
Título revista abreviado:Lect. Notes Comput. Sci.
ISSN:03029743
Registro:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v5407LNCS_n_p16_Areces

Referencias:

  • Alur, R., Henzinger, T.: A really temporal logic. Journal of the 164-169(1989); Areces, C., Hybrid logics: The old and the new (2007) Proceedings of LogKCA, , San Sebastian, Spain
  • Areces, C., Figueira, D., Figueira, S., Mera, S., Expressive power and decidability for memory logics (2008) LNCS, 5110, pp. 56-68. , Hodges, W, de Queiroz, R, eds, Logic, Language, Information and Computation, Springer, Heidelberg
  • Areces, C., Figueira, D., Figueira, S., Mera, S.: Expressive power and decidability for memory logics. Journal of Computer and System Sciences (submitted, 2008); Extended version of [3]; Areces, C., ten Cate, B., Hybrid logics (2006) Handbook of Modal Logics, , Blackburn, P, Wolter, F, van Benthem, J, eds, Elsevier, Amsterdam
  • 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, Cambridge
  • Blackburn, P., Tzakova, M., Hybrid completeness (1998) Logic Journal of the IGPL, 6 (4), pp. 625-650
  • Gerbrandy, J., (2001) Bisimulations on Planet Kripke, , PhD thesis, University of Amsterdam, ILLC Dissertation series DS, 1999
  • Harel, E., Lichtenstein, O., Pnueli, A., Explicit clock temporal logic (1990) Proceedings of LICS 1990, 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, New York
  • Lutz, C., (2002) The complexity of reasoning with concrete domains, , PhD 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 2001: Proceedings of the 8th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 51-67. , Morgan Kaufmann Publishers Inc, San Francisco
  • 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, Dordrecht

Citas:

---------- APA ----------
Areces, C., Figueira, S. & Mera, S. (2009) . Completeness results for memory logics. International Symposium on Logical Foundations of Computer Science, LFCS 2009, 5407 LNCS, 16-30.
http://dx.doi.org/10.1007/978-3-540-92687-0_2
---------- CHICAGO ----------
Areces, C., Figueira, S., Mera, S. "Completeness results for memory logics" . International Symposium on Logical Foundations of Computer Science, LFCS 2009 5407 LNCS (2009) : 16-30.
http://dx.doi.org/10.1007/978-3-540-92687-0_2
---------- MLA ----------
Areces, C., Figueira, S., Mera, S. "Completeness results for memory logics" . International Symposium on Logical Foundations of Computer Science, LFCS 2009, vol. 5407 LNCS, 2009, pp. 16-30.
http://dx.doi.org/10.1007/978-3-540-92687-0_2
---------- VANCOUVER ----------
Areces, C., Figueira, S., Mera, S. Completeness results for memory logics. Lect. Notes Comput. Sci. 2009;5407 LNCS:16-30.
http://dx.doi.org/10.1007/978-3-540-92687-0_2