Abstract
We show that for each property of graphs \(\mathcal{G}\) in NP there is a sequence φ 1, φ 2, ... of formulas of the full hybrid logic which are satisfied exactly by the frames in \(\mathcal{G}\). Moreover, the size of φ n is bounded by a polynomial. We also show that the same holds for each graph property in the polynomial hierarchy.
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., Blackburn, P., Marx, M.: Hybrid logics: Characterization, interpolation and complexity. Journal of Symbolic Logic 66(3), 977–1010 (2001)
Areces, C., ten Cate, B.: Hybrid logics. In: Blackburn, P., van Benthem, J., Wolter, F. (eds.) Handbook of Modal Logic, vol. 3, pp. 821–868. Elsevier Science Ltd., Amsterdam (2007)
Barbosa, V.: An introduction to distributed algorithms. The MIT Press, Cambridge (1996)
Benevides, M., Schechter, L.: Using modal logics to express and check global graph properties. Logic Journal of IGPL 17(5), 559 (2009)
Blackburn, P., De Rijke, M., Venema, Y.: Modal logic. Cambridge Univ. Pr., Cambridge (2002)
Bradfield, J., Stirling, C.: Modal mu-calculi. Handbook of Modal Logic 3, 721–756 (2007)
Ebbinghaus, H., Flum, J., Thomas, W.: Mathematical logic. Springer, Heidelberg (1994)
Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. In: Karp, R. (ed.) Complexity of Computation. SIAM-AMS Proceedings, vol. 7, pp. 43–73. AMS, Providence (1974)
Grädel, E.: Why are modal logics so robustly decidable? In: Paun, G., Rozenberg, G., Salomaa, A. (eds.) Current Trends in Theoretical Computer Science. Entering the 21st Century, pp. 393–408. World Scientific, Singapore (2001)
Haken, W., Appel, K., Koch, J.: Every planar map is four colorable. Contemporary Mathematics, vol. 98. American Mathematical Society, Providence (1989)
Immerman, N.: Descriptive complexity. Springer, Heidelberg (1999)
Lynch, N.: Distributed algorithms. Morgan Kaufmann, San Francisco (1996)
Papadimitriou, C.: Computational complexity. John Wiley and Sons Ltd., Chichester (2003)
Robertson, N., Sanders, D., Seymour, P., Thomas, R.: The four-colour theorem. Journal of Combinatorial Theory, Series B 70(1), 2–44 (1997)
Vardi, M.: Why is modal logic so robustly decidable. In: Immerman, N., Kolaitis, P.G. (eds.) Descriptive Complexity and Finite Models. Discrete Mathematics and Theoretical Computer Science, vol. 31, pp. 149–184. American Mathematical Society, Providence (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ferreira, F.M., Freire, C.M., Benevides, M.R.F., Schechter, L.M., Martins, A.T. (2011). Hybrid Logics and NP Graph Properties. In: Beklemishev, L.D., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2011. Lecture Notes in Computer Science(), vol 6642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20920-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-20920-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20919-2
Online ISBN: 978-3-642-20920-8
eBook Packages: Computer ScienceComputer Science (R0)