{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:47:24Z","timestamp":1725670044868},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642287282"},{"type":"electronic","value":"9783642287299"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28729-9_16","type":"book-chapter","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T20:47:40Z","timestamp":1332449260000},"page":"240-254","source":"Crossref","is-referenced-by-count":0,"title":["Narcissists Are Easy, Stepmothers Are Hard"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Gor\u00edn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1004275029985","volume":"27","author":"H. Andr\u00e9ka","year":"1998","unstructured":"Andr\u00e9ka, H., van Benthem, J., N\u00e9meti, I.: Modal languages and bounded fragments of predicate logic. J. Phil. Log.\u00a027(3), 217\u2013274 (1998)","journal-title":"J. Phil. Log."},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1017\/S1755020310000389","volume":"2","author":"C. Areces","year":"2011","unstructured":"Areces, C., Figueira, D., Figueira, S., Mera, S.: The expressive power of memory logics. Rev. Symb. Log.\u00a02, 290\u2013318 (2011)","journal-title":"Rev. Symb. Log."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Areces, C., ten Cate, B.: Hybrid logics. In: Handbook of Modal Logics. Elsevier (2006)","DOI":"10.1016\/S1570-2464(07)80017-6"},{"key":"16_CR4","unstructured":"Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook. Cambridge University Press (2003)"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0304-3975(93)90076-6","volume":"114","author":"M. Barr","year":"1993","unstructured":"Barr, M.: Terminal coalgebras in well-founded set theory. Theoret. Comput. Sci.\u00a0114, 299\u2013315 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR6","series-title":"Perspectives in Mathematical Logic","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59207-2","volume-title":"The Classical Decision Problem","author":"E. B\u00f6rger","year":"1997","unstructured":"B\u00f6rger, E., Gr\u00e4del, E., Gurevich, Y.: The Classical Decision Problem. Perspectives in Mathematical Logic. Springer, Heidelberg (1997)"},{"key":"16_CR7","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. Log.\u00a041, 267\u2013298 (2002)","journal-title":"Arch. Math. Log."},{"key":"16_CR8","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. Form. Log.\u00a013, 516\u2013520 (1972)","journal-title":"Notre Dame J. Form. Log."},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-12002-2_9","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R. Gor\u00e9","year":"2010","unstructured":"Gor\u00e9, R., Kupke, C., Pattinson, D.: Optimal Tableau Algorithms for Coalgebraic Logics. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 114\u2013128. Springer, Heidelberg (2010)"},{"key":"16_CR10","unstructured":"Gor\u00edn, D., Schr\u00f6der, L.: Celebrities don\u2019t follow their followers: Binding and qualified number restrictions. Technical report, DFKI GmbH (2011)"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del, E.: On the restraining power of guards. J. Symb. Log.\u00a064 (1999)","DOI":"10.2307\/2586808"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1093\/logcom\/9.3.385","volume":"9","author":"I. Horrocks","year":"1999","unstructured":"Horrocks, I., Sattler, U.: A description logic with transitive and inverse roles and role hierarchies. J. Log. Comput.\u00a09, 385\u2013410 (1999)","journal-title":"J. Log. Comput."},{"issue":"1","key":"16_CR13","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), 1\u201328 (1991)","journal-title":"Inform. Comput."},{"key":"16_CR14","unstructured":"Marx, M.: Narcissists, stepmothers and spies. In: International Workshop on Description Logics, CEUR Workshop Proceedings (2002), \n                  \n                    CEUR-WS.org"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-642-00596-1_11","volume-title":"Foundations of Software Science and Computational Structures","author":"R. Myers","year":"2009","unstructured":"Myers, R., Pattinson, D., Schr\u00f6der, L.: Coalgebraic Hybrid Logic. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 137\u2013151. Springer, Heidelberg (2009)"},{"key":"16_CR16","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."},{"issue":"1","key":"16_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1093\/logcom\/exl034","volume":"17","author":"I. Pratt-Hartmann","year":"2007","unstructured":"Pratt-Hartmann, I.: Complexity of the guarded two-variable fragment with counting quantifiers. J. Log. Comput.\u00a017(1), 133\u2013155 (2007)","journal-title":"J. Log. Comput."},{"key":"16_CR18","unstructured":"Schneider, T.: The Complexity of Hybrid Logics over Restricted Classes of Frames. PhD thesis, Univ. of Jena (2007)"},{"key":"16_CR19","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":"16_CR20","unstructured":"Schr\u00f6der, L., Pattinson, D.: How many toes do I have? Parthood and number restrictions in description logics. In: Principles of Knowledge Representation and Reasoning, KR 2008, pp. 307\u2013218. AAAI Press (2008)"},{"key":"16_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1462179.1462185","volume":"10","author":"L. Schr\u00f6der","year":"2009","unstructured":"Schr\u00f6der, L., Pattinson, D.: PSPACE bounds for rank-1 modal logics. ACM Trans. Comput. Log.\u00a010, 13:1\u201313:33 (2009)","journal-title":"ACM Trans. Comput. Log."},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/11538363_24","volume-title":"Computer Science Logic","author":"B. ten Cate","year":"2005","unstructured":"ten Cate, B., Franceschet, M.: On the Complexity of Hybrid Logics with Binders. In: Ong, L. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 339\u2013354. Springer, Heidelberg (2005)"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"van Benthem, J.: Correspondence theory. In: Handbook of Philosophical Logic, vol.\u00a03, pp. 325\u2013408. Kluwer (2001)","DOI":"10.1007\/978-94-017-0454-0_4"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28729-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:44:43Z","timestamp":1558313083000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28729-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642287282","9783642287299"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28729-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}