A Road-Map on Complexity for Hybrid Logics
- 1 January 1999
- book chapter
- Published by Springer Nature
- p. 307-321
- https://doi.org/10.1007/3-540-48168-0_22
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Quantifiers in combinatory PDL: Completeness, definability, incompletenessPublished by Springer Nature ,2006
- Hybrid languages and temporal logicLogic Journal of the IGPL, 1999
- Hierarchies of modal and temporal logics with reference pointersJournal of Logic, Language and Information, 1996
- Hybrid languagesJournal of Logic, Language and Information, 1995
- A guide to completeness and complexity for modal logics of knowledge and beliefArtificial Intelligence, 1992
- Domino-tiling gamesJournal of Computer and System Sciences, 1986
- Towards a general theory of action and timeArtificial Intelligence, 1984
- The Logic of TimePublished by Springer Nature ,1983
- The Computational Complexity of Provability in Systems of Modal Propositional LogicSIAM Journal on Computing, 1977
- An approach to tense logic1Theoria, 1970