{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T10:50:59Z","timestamp":1753354259837},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642005954"},{"type":"electronic","value":"9783642005961"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00596-1_11","type":"book-chapter","created":{"date-parts":[[2009,3,26]],"date-time":"2009-03-26T21:13:03Z","timestamp":1238101983000},"page":"137-151","source":"Crossref","is-referenced-by-count":12,"title":["Coalgebraic Hybrid Logic"],"prefix":"10.1007","author":[{"given":"Rob","family":"Myers","sequence":"first","affiliation":[]},{"given":"Dirk","family":"Pattinson","sequence":"additional","affiliation":[]},{"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/3-540-48168-0_22","volume-title":"Computer Science Logic","author":"C. Areces","year":"1999","unstructured":"Areces, C., Blackburn, P., Marx, M.: A road-map on complexity for hybrid logics. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 307\u2013321. Springer, Heidelberg (1999)"},{"key":"11_CR2","volume-title":"Handbook of Modal Logics","author":"C. Areces","year":"2006","unstructured":"Areces, C., ten Cate, B.: Hybrid logics. In: Blackburn, P., Wolter, F., van Benthem, J. (eds.) Handbook of Modal Logics. Elsevier, Amsterdam (2006)"},{"volume-title":"The Description Logic Handbook","year":"2003","key":"11_CR3","unstructured":"Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook. Cambridge University Press, Cambridge (2003)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Baader, F., Milicic, M., Lutz, C., Sattler, U., Wolter, F.: Integrating description logics and action formalisms for reasoning about web services. LTCS-Report LTCS-05-02, Dresden University of Technology (2005), http:\/\/lat.inf.tu-dresden.de\/research\/reports.html","DOI":"10.25368\/2010.145"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1093\/logcom\/exi056","volume":"16","author":"N. Bezhanishvili","year":"2006","unstructured":"Bezhanishvili, N., ten Cate, B.: Transfer results for hybrid logic. Part 1: the case without satisfaction operators. J. Logic Comput.\u00a016, 177\u2013197 (2006)","journal-title":"J. Logic Comput."},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/3-540-45616-3_4","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"P. Blackburn","year":"2002","unstructured":"Blackburn, P., Marx, M.: Tableaux for quantified hybrid logic. In: Egly, U., Ferm\u00fcller, C. (eds.) TABLEAUX 2002. LNCS (LNAI), vol.\u00a02381, pp. 38\u201352. Springer, Heidelberg (2002)"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1093\/logcom\/exm014","volume":"17","author":"T. Bolander","year":"2007","unstructured":"Bolander, T., Blackburn, P.: Termination for hybrid tableaus. J. Logic Comput.\u00a017, 517\u2013554 (2007)","journal-title":"J. Logic Comput."},{"issue":"6","key":"11_CR8","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1093\/logcom\/exl008","volume":"16","author":"T. Bolander","year":"2006","unstructured":"Bolander, T., Bra\u00fcner, T.: Tableau-based decision procedures for hybrid logic. J. Log. Comput.\u00a016(6), 737\u2013763 (2006)","journal-title":"J. Log. Comput."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1137\/0213030","volume":"13","author":"R. Book","year":"1984","unstructured":"Book, R., Long, T., Selman, A.: Quantitative relativizations of complexity classes. SIAM J. Computing\u00a013, 461\u2013487 (1984)","journal-title":"SIAM J. Computing"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10849-005-3927-y","volume":"14","author":"T. Bra\u00fcner","year":"2005","unstructured":"Bra\u00fcner, T.: Natural deduction for first-order hybrid logic. J. Logic, Language and Information\u00a014, 173\u2013198 (2005)","journal-title":"J. Logic, Language and Information"},{"key":"11_CR11","series-title":"ENTCS","volume-title":"Methods for Modalities, M4M-5","author":"G. Calin","year":"2008","unstructured":"Calin, G., Myers, R., Pattinson, D., Schr\u00f6der, L.: CoLoSS: The coalgebraic logic satisfiability solver (system description). In: Methods for Modalities, M4M-5. ENTCS. Elsevier, Amsterdam (to appear, 2008)"},{"key":"11_CR12","unstructured":"ten Cate, B.: Model theory for extended modal languages. PhD thesis, University of Amsterdam, ILLC Dissertation Series DS-2005-01 (2005)"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A. Chandra","year":"1981","unstructured":"Chandra, A., Stockmeyer, L.: Alternation. J. ACM\u00a028, 114\u2013133 (1981)","journal-title":"J. ACM"},{"key":"11_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511621192","volume-title":"Modal Logic","author":"B. Chellas","year":"1980","unstructured":"Chellas, B.: Modal Logic. Cambridge University Press, Cambridge (1980)"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s001530100110","volume":"41","author":"G. D\u2019Agostino","year":"2002","unstructured":"D\u2019Agostino, G., Visser, A.: Finality regained: A coalgebraic study of Scott-sets and multisets. Arch. Math. Logic\u00a041, 267\u2013298 (2002)","journal-title":"Arch. Math. Logic"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/11814771_44","volume-title":"Automated Reasoning","author":"S. Demri","year":"2006","unstructured":"Demri, S., Lugiez, D.: Presburger modal logic is PSPACE-complete. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 541\u2013556. Springer, Heidelberg (2006)"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1145\/174652.174658","volume":"41","author":"R. Fagin","year":"1994","unstructured":"Fagin, R., Halpern, J.Y.: Reasoning about knowledge and probability. J. ACM\u00a041, 340\u2013367 (1994)","journal-title":"J. ACM"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1305\/ndjfl\/1093890715","volume":"13","author":"K. Fine","year":"1972","unstructured":"Fine, K.: In so many possible worlds. Notre Dame J. Formal Logic\u00a013, 516\u2013520 (1972)","journal-title":"Notre Dame J. Formal Logic"},{"key":"11_CR19","unstructured":"Haarslev, V., M\u00f6ller, R., van der Straeten, R., Wessel, M.: Extended query facilities for racer and an application to software-engineering problems. In: Description Logics, DL 2004, pp. 148\u2013157 (2004)"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1006\/game.1999.0788","volume":"35","author":"A. Heifetz","year":"2001","unstructured":"Heifetz, A., Mongin, P.: Probabilistic logic for type spaces. Games and Economic Behavior\u00a035, 31\u201353 (2001)","journal-title":"Games and Economic Behavior"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K. Larsen","year":"1991","unstructured":"Larsen, K., Skou, A.: Bisimulation through probabilistic testing. Inform. Comput.\u00a094, 1\u201328 (1991)","journal-title":"Inform. Comput."},{"key":"11_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511520006","volume-title":"Relevant Logic: A Philosophical Interpretation","author":"E. Mares","year":"2004","unstructured":"Mares, E.: Relevant Logic: A Philosophical Interpretation. Cambridge University Press, Cambridge (2004)"},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1145\/322276.322287","volume":"28","author":"C. Papadimitriou","year":"1981","unstructured":"Papadimitriou, C.: On the complexity of integer programming. J. ACM\u00a028, 765\u2013768 (1981)","journal-title":"J. ACM"},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(03)00201-9","volume":"309","author":"D. Pattinson","year":"2003","unstructured":"Pattinson, D.: Coalgebraic modal logic: Soundness, completeness and decidability of local consequence. Theoret. Comput. Sci.\u00a0309, 177\u2013193 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR25","series-title":"ENTCS","first-page":"221","volume-title":"Coalgebraic Methods in Computer Science, CMCS 2008","author":"D. Pattinson","year":"2008","unstructured":"Pattinson, D., Schr\u00f6der, L.: Admissibility of cut in coalgebraic logics. In: Coalgebraic Methods in Computer Science, CMCS 2008. ENTCS, vol.\u00a0203, pp. 221\u2013241. Elsevier, Amsterdam (2008)"},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/logcom\/12.1.149","volume":"12","author":"M. Pauly","year":"2002","unstructured":"Pauly, M.: A modal logic for coalitional power in games. J. Logic Comput.\u00a012, 149\u2013166 (2002)","journal-title":"J. Logic Comput."},{"key":"11_CR27","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.jlap.2006.11.004","volume":"73","author":"L. Schr\u00f6der","year":"2007","unstructured":"Schr\u00f6der, L.: A finite model construction for coalgebraic modal logic. J. Log. Algebr. Prog.\u00a073, 97\u2013110 (2007)","journal-title":"J. Log. Algebr. Prog."},{"key":"11_CR28","first-page":"231","volume-title":"Logic in Computer Science, LICS 2006","author":"L. Schr\u00f6der","year":"2006","unstructured":"Schr\u00f6der, L., Pattinson, D.: PSPACE reasoning for rank-1 modal logics. In: Logic in Computer Science, LICS 2006, pp. 231\u2013240. IEEE, Los Alamitos (2006); Full version to appear in ACM TOCL"},{"key":"11_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-540-85845-4_40","volume-title":"KI 2008: Advances in Artificial Intelligence","author":"L. Schr\u00f6der","year":"2008","unstructured":"Schr\u00f6der, L., Pattinson, D.: Shallow models for non-iterative modal logics. In: Dengel, A.R., Berns, K., Breuel, T.M., Bomarius, F., Roth-Berghofer, T.R. (eds.) KI 2008. LNCS (LNAI), vol.\u00a05243, pp. 324\u2013331. Springer, Heidelberg (2008)"},{"key":"11_CR30","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1093\/logcom\/11.5.671","volume":"11","author":"J. Seligman","year":"2001","unstructured":"Seligman, J.: Internalization: The case of hybrid logics. J. Logic Comput.\u00a011, 671\u2013689 (2001)","journal-title":"J. Logic Comput."},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Sirin, E., Parsia, B., Grau, B.C., Kalyanpur, A., Katz, Y.: Pellet: A practical OWL-DL reasoner. J. Web Semantics (2006)","DOI":"10.2139\/ssrn.3199351"},{"key":"11_CR32","volume-title":"Basic Proof Theory","author":"A. Troelstra","year":"1996","unstructured":"Troelstra, A., Schwichtenberg, H.: Basic Proof Theory. Cambridge University Press, Cambridge (1996)"},{"key":"11_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/11814771_26","volume-title":"Automated Reasoning","author":"D. Tsarkov","year":"2006","unstructured":"Tsarkov, D., Horrocks, I.: FaCT++ description logic reasoner: System description. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 292\u2013297. Springer, Heidelberg (2006)"},{"key":"11_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-48754-9_24","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"M. Tzakova","year":"1999","unstructured":"Tzakova, M.: Tableau calculi for hybrid logics. In: Murray, N.V. (ed.) TABLEAUX 1999. LNCS, vol.\u00a01617, pp. 278\u2013292. Springer, Heidelberg (1999)"},{"key":"11_CR35","unstructured":"Zolin, E.: The description logic complexity navigator (2007), http:\/\/www.cs.man.ac.uk\/~ezolin\/dl"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00596-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T12:51:53Z","timestamp":1684932713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00596-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642005954","9783642005961"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00596-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}