On the complexity of hybrid logics with binders

Lecture Notes in Computer Science

Volumn 3634, Issue , 2005, Pages 339-354

  Ten Cate, Balder ^a   Franceschet, Massimo ^a,b  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b UNIVERSITY OF CHIETI   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; MODAL ANALYSIS;

HYBRID LOGICS; KRIPKE STRUCTURES; MODAL LOGIC; MODEL CHECKING;

FORMAL LOGIC;

EID: 26944435855     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538363_24     Document Type: Conference Paper

References (21)

1. Andréka, H., van Benthem, J., Németi, I.: Modal logics and bounded fagments of predicate logic. Journal of Philosophical Logic 27 (1998) 217-274
2. Grädel, E.: On the restraining power of guards. Journal of Symbolic Logic 64 (1999) 1719-1742
3. Mortimer, M.: On languages with two variables. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 21 (1975) 135-140
4. Grädel, E., Otto, M.: On logics with two variables. Theoretical computer science 224 (1999) 73-113
5. Areces, C., Blackburn, P., Marx, M.: Hybrid logics: Characterization, interpolation, and complexity. Journal of Symbolic Logic 66 (2001) 977-1010
6. ten Cate, B.: Interpolation for extended modal languages. Journal of Symbolic Logic 70 (2005) 223-234
7. ten Cate, B.: Model theory for extended modal languages. PhD thesis, University of Amsterdam (2005) ILLC Dissertation Series DS-2005-01.
8. Franceschet, M., de Rijke, M.: Model checking for hybrid logics (with an application to semistructured data). Journal of Applied Logics (2005) To appear.
9. Blackburn, P., Seligman, J.: Hybrid languages. Journal of Logic, Language and Information 4 (1995) 251-272
10. Harel, D.: Recurring dominoes: making the highly undecidable highly understandable. Annals of Discrete Mathematics 24 (1985) 51-72
11. Goranko, V.: Hierarchies of modal and temporal logics with reference pointers. Journal of Logic, Language, and Information 5 (1996) 1-24
12. Areces, C., Blackburn, P., Marx, M.: A road-map on complexity for hybrid logics. In Flum, J., Guez-Artalejo, M.R., eds.: Proceedings of the 8th Annual Conference of the EACSL, Madrid (1999)
13. Marx, M.: Narcissists, stepmothers and spies. In: Proceedings of the International Workshop on Description Logics. (2002)
14. Fisher, M., Ladner, R.: Propositional dynamic logic of regular programs. Journal of Computer and System Sciences 18 (1979) 194-211
15. Areces, C., Blackburn, P., Marx, M.: The computational complexity of hybrid temporal logics. Logic Journal of the IGPL 8 (2000) 653-679
16. ten Cate, B., Franceschet, M.: Guarded fragments with constants. Journal of Logic, Language, and Information (2005) To appear.
17. Börger, E., Grädel, E., Gurevich, Y.: The Classical Decision Problem. Springer, Berlin (1997)
18. ten Cate, B., Franceschet, M.: On the complexity of hybrid logics with binders. Technical Report PP-2005-02, ILLC, University of Amsterdam (2005)
19. Vardi, M.Y.: On the complexity of bounded-variable queries. In: Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. (1995) 266-276
20. ten Cate, B., Franceschet, M.: Guarded fragments with constants. Technical Report PP-2004-32, ILLC, University of Amsterdam (2004)
21. Blackburn, P.: Representation, reasoning, and relational structures: A hybrid logic manifesto. Logic Journal of the IGPL 8 (2000) 339-365