{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:25:13Z","timestamp":1725582313117},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642209192"},{"type":"electronic","value":"9783642209208"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20920-8_15","type":"book-chapter","created":{"date-parts":[[2011,4,28]],"date-time":"2011-04-28T04:54:38Z","timestamp":1303966478000},"page":"123-134","source":"Crossref","is-referenced-by-count":0,"title":["Hybrid Logics and NP Graph Properties"],"prefix":"10.1007","author":[{"given":"Francicleber Martins","family":"Ferreira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cibele Matos","family":"Freire","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario R. F.","family":"Benevides","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. Menasch\u00e9","family":"Schechter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ana Teresa","family":"Martins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"publisher","first-page":"977","DOI":"10.2307\/2695090","volume":"66","author":"C. Areces","year":"2001","unstructured":"Areces, C., Blackburn, P., Marx, M.: Hybrid logics: Characterization, interpolation and complexity. Journal of Symbolic Logic\u00a066(3), 977\u20131010 (2001)","journal-title":"Journal of Symbolic Logic"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1016\/S1570-2464(07)80017-6","volume-title":"Handbook of Modal Logic","author":"C. Areces","year":"2007","unstructured":"Areces, C., ten Cate, B.: Hybrid logics. In: Blackburn, P., van Benthem, J., Wolter, F. (eds.) Handbook of Modal Logic, vol.\u00a03, pp. 821\u2013868. Elsevier Science Ltd., Amsterdam (2007)"},{"key":"15_CR3","volume-title":"An introduction to distributed algorithms","author":"V. Barbosa","year":"1996","unstructured":"Barbosa, V.: An introduction to distributed algorithms. The MIT Press, Cambridge (1996)"},{"issue":"5","key":"15_CR4","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1093\/jigpal\/jzp021","volume":"17","author":"M. Benevides","year":"2009","unstructured":"Benevides, M., Schechter, L.: Using modal logics to express and check global graph properties. Logic Journal of IGPL\u00a017(5), 559 (2009)","journal-title":"Logic Journal of IGPL"},{"key":"15_CR5","volume-title":"Modal logic","author":"P. Blackburn","year":"2002","unstructured":"Blackburn, P., De Rijke, M., Venema, Y.: Modal logic. Cambridge Univ. Pr., Cambridge (2002)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/S1570-2464(07)80015-2","volume":"3","author":"J. Bradfield","year":"2007","unstructured":"Bradfield, J., Stirling, C.: Modal mu-calculi. Handbook of Modal Logic\u00a03, 721\u2013756 (2007)","journal-title":"Handbook of Modal Logic"},{"key":"15_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2355-7","volume-title":"Mathematical logic","author":"H. Ebbinghaus","year":"1994","unstructured":"Ebbinghaus, H., Flum, J., Thomas, W.: Mathematical logic. Springer, Heidelberg (1994)"},{"key":"15_CR8","series-title":"SIAM-AMS Proceedings","first-page":"43","volume-title":"Complexity of Computation","author":"R. Fagin","year":"1974","unstructured":"Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. In: Karp, R. (ed.) Complexity of Computation. SIAM-AMS Proceedings, vol.\u00a07, pp. 43\u201373. AMS, Providence (1974)"},{"key":"15_CR9","series-title":"Entering the 21st Century","first-page":"393","volume-title":"Current Trends in Theoretical Computer Science","author":"E. Gr\u00e4del","year":"2001","unstructured":"Gr\u00e4del, 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\u2013408. World Scientific, Singapore (2001)"},{"key":"15_CR10","series-title":"Contemporary Mathematics","volume-title":"Every planar map is four colorable","author":"W. Haken","year":"1989","unstructured":"Haken, W., Appel, K., Koch, J.: Every planar map is four colorable. Contemporary Mathematics, vol.\u00a098. American Mathematical Society, Providence (1989)"},{"key":"15_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive complexity","author":"N. Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive complexity. Springer, Heidelberg (1999)"},{"key":"15_CR12","volume-title":"Distributed algorithms","author":"N. Lynch","year":"1996","unstructured":"Lynch, N.: Distributed algorithms. Morgan Kaufmann, San Francisco (1996)"},{"key":"15_CR13","volume-title":"Computational complexity","author":"C. Papadimitriou","year":"2003","unstructured":"Papadimitriou, C.: Computational complexity. John Wiley and Sons Ltd., Chichester (2003)"},{"issue":"1","key":"15_CR14","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jctb.1997.1750","volume":"70","author":"N. Robertson","year":"1997","unstructured":"Robertson, N., Sanders, D., Seymour, P., Thomas, R.: The four-colour theorem. Journal of Combinatorial Theory, Series B\u00a070(1), 2\u201344 (1997)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"15_CR15","series-title":"Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1090\/dimacs\/031\/05","volume-title":"Descriptive Complexity and Finite Models","author":"M. Vardi","year":"1996","unstructured":"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.\u00a031, pp. 149\u2013184. American Mathematical Society, Providence (1996)"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20920-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T02:06:59Z","timestamp":1558577219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20920-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642209192","9783642209208"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20920-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}